leetcode 367[easy]----Valid Perfect Square
2017-12-18 16:38
302 查看
难度：easy
Given 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 library function such as
Example 1:
Example 2:
思路： 此题的思路与 69. Sqrt(x)
一摸一样，用两分法。
链接： http://blog.csdn.net/fawnzou2017/article/details/78698178。
high= nums+1的初始设置，是因为要考虑num=1
Given 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 library function such as
sqrt.
Example 1:
Input: 16 Returns: True
Example 2:
Input: 14 Returns: False
思路： 此题的思路与 69. Sqrt(x)
一摸一样，用两分法。
链接： http://blog.csdn.net/fawnzou2017/article/details/78698178。
high= nums+1的初始设置，是因为要考虑num=1
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Leetcode 367 Valid Perfect Square
- leetcode 367 Valid Perfect Square
- leetcode :Binary Search： Valid Perfect Square(367)
- [leetcode-367]Valid Perfect Square(java)
- LeetCode 367 Valid Perfect Square
- [leetcode] Valid Perfect Square
- LeetCode -- Valid Perfect Square
- LeetCode Valid Perfect Square
- Math-367-Valid Perfect Square
- 【LeetCode】Valid Perfect Square 解题报告
- LeetCode Valid Perfect Square（是否是平方数）
- 367. Valid Perfect Square**
- [LeetCode] Valid Perfect Square 检验完全平方数
- leetcode之Valid Perfect Square
- leetcode_Valid Perfect Square
- LeetCode : Valid Perfect Square
- LeetCode Valid Perfect Square
- 【Leetcode】valid perfect square
- LeetCode 第 367 题 (Valid Perfect Square)
- leetcode submission/20161004(Valid Perfect Square)