這裡有leetcode題集分類整理!!!
sqrt:(O(根号c))
class Solution {
public boolean judgeSquareSum(int c) {
for (long i = 0 ; i * i <= c ; i ++) {
double b = Math.sqrt(c - i * i);
if (b == (int)b) return true;
}
return false;
}
}
方法二:雙指針 (O(根号c))
class Solution {
public boolean judgeSquareSum(int c) {
int left = 0;
int right = (int) Math.sqrt(c);
while (left <= right) {
int sum = left * left + right * right;
if (sum == c) {
return true;
} else if (sum > c) {
right--;
} else {
left++;
}
}
return false;
}
}
作者:LeetCode-Solution
連結:https://leetcode-cn.com/problems/sum-of-square-numbers/solution/ping-fang-shu-zhi-he-by-leetcode-solutio-8ydl/
來源:力扣(LeetCode)
著作權歸作者所有。商業轉載請聯系作者獲得授權,非商業轉載請注明出處。