?LeetCode刷題實戰(zhàn)367：有效的完全平方數(shù)
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 function such as sqrt.
示例
示例 1：
輸入：num = 16
輸出：true
示例 2：
輸入：num = 14
輸出：false
解題
class Solution {
public boolean isPerfectSquare(int num) {
if (num < 2) {
return true;
}
long left = 2, right = num / 2, x, guessSquared;
while (left <= right) {
x = left + (right - left) / 2;
guessSquared = x * x;
if (guessSquared == num) {
return true;
}
if (guessSquared > num) {
right = x - 1;
} else {
left = x + 1;
}
}
return false;
}
}
作者：LeetCode
鏈接：https://leetcode-cn.com/problems/valid-perfect-square/solution/you-xiao-de-wan-quan-ping-fang-shu-by-leetcode/
來源：力扣（LeetCode）
著作權歸作者所有。商業(yè)轉載請聯(lián)系作者獲得授權，非商業(yè)轉載請注明出處。