LeetCode:Valid Perfect Square
Valid Perfect Square
Total Accepted: 1976 Total Submissions: 5317 Difficulty: Medium
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
Credits:
Special thanks to @elmirap for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
Hide Tags Hide Similar Problems
思路：
二分查找。
java code:
public class Solution {
public boolean isPerfectSquare(int num) {
long lo = 1, hi = num / 2;
if(num == 1) return true;
long x = num;
while(lo <= hi) {
long mid = lo + (hi - lo) / 2;
if(mid * mid == x)
return true;
else if(mid * mid < x)
lo = mid + 1;
else
hi = mid - 1;
}
return false;
}
}- 顶
- 0
- 踩
- 0
软件工程阅读排行
-
2014-10-15
-
2016-06-06
-
2013-05-06
-
yershop商城系统开发一——thinkphp和onethink简析
2016-06-08
-
013--Floyd算法-动态规划-《算法设计技巧与分析》M.H.A学习笔记
2016-06-28
-
解决Visual Studio 2010下TFS服务无法连接问题
2014-05-30
-
2016-06-06
-
2013-05-06
最新文章
-
2022-03-16
-
2022-03-16
-
2022-03-16
-
Redis之RedisTemplate配置方式(序列和反序列化)
2022-03-16
-
2022-03-16
-
2022-03-16
-
2022-03-16
-
2019-07-10
热门源码
