leetcode 633. 平方数之和 medium
题目描述:
解题思路:
双指针, i从0开始取,j从可取的最大数sqrt(c) 开始
代码:
//
class Solution {
public:
bool judgeSquareSum(int c) {
int i = 0;
int j = sqrt(c);
while (i<=j){
long long cur = (long long)i*i + j*j;
if (cur > c)
j--;
else if (cur < c)
i++;
else
return true;
}
return false;
}
};