[LeetCode] 367. Valid Perfect Square
文章目录
Problem
Given a positive integer num, write a function which returns True if num is a perfect square else False.
Example
For example:
Given num = 16
Returns True
Solution
class Solution {
public boolean isPerfectSquare(int num) {
if (num == 1) return true;
long n = (long)num;
long start = 1, end = n/2;
while (start <= end) {
long mid = start+(end-start)/2;
if (mid*mid == n) return true;
else if (mid*mid < n) start = mid+1;
else end = mid-1;
}
return false;
}
}
评论
登录后参与技术讨论,分享你的经验与见解。
登录 / 注册暂无评论