2019年10月18日
[LeetCode] 50. Pow(x, n)
摘要： Implement pow(x, n), which calculates x raised to the power n (x^n). Example 1: Input: 2.00000, 10 Output: 1024.00000 Example 2: Input: 2.10000, 3 Out 阅读全文
posted @ 2019-10-18 01:20 CNoodle 阅读(441) 评论(0) 推荐(0)
[LeetCode] 367. Valid Perfect Square
摘要： Given a positive integer num, write a function which returns True if num is a perfect square else False. Follow up: Do not use any built-in library fu 阅读全文
posted @ 2019-10-18 00:56 CNoodle 阅读(145) 评论(0) 推荐(0)
[LeetCode] 69. Sqrt(x)
摘要： Given a non-negative integer x, return the square root of x rounded down to the nearest integer. The returned integer should be non-negative as well. 阅读全文
posted @ 2019-10-18 00:36 CNoodle 阅读(507) 评论(0) 推荐(0)