LeetCode perfect-阿里云

LeetCode 367. Valid Perfect Square

DescriptionGiven a positive integer num, write a function which returns True if num is a perfect square else False.Note: Do not use any built-in libra...

LeetCode 279. Perfect Squares

DescriptionGiven a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.Example 1:Input:...

[LeetCode] Valid Perfect Square 检验完全平方数

Given a positive integer num, write a function which returns True if num is a perfect square else False. Note: Do not use any...

[LeetCode] Perfect Rectangle 完美矩形

Given N axis-aligned rectangles where N > 0, determine if they all together form an exact cover of a rectangular region. Each rectangle is represen...

[LeetCode] Perfect Number 完美数字

We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself. Now, given...

[LeetCode] Perfect Squares

Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. For example, given n = 12,...

[LeetCode] Perfect Squares

Well, after seeing the similar problems, you may have known how to solve this problem. Yeah, just to construct larger numbers from smaller numbers by ...