#Leetcode 633题,平方数之和
class Solution {
public:
bool judgeSquareSum(int c) {
for (int a = 1;a <= c;a++){
for (int b = 1;b <=c;b++){
if (a * a + b * b == c){
return true;
}
}
}
return false;
}
};
#Leetcode 633题,平方数之和
class Solution {
public:
bool judgeSquareSum(int c) {
for (int a = 1;a <= c;a++){
for (int b = 1;b <=c;b++){
if (a * a + b * b == c){
return true;
}
}
}
return false;
}
};