#Leetcode# 633. Sum of Square Numbers

标签：and   ++   false   https   class   turn   href   nat   integer   

https://leetcode.com/problems/sum-of-square-numbers/

Given a non-negative integer c, your task is to decide whether there‘re two integers a and b such that a2 + b2 = c.

Example 1:

Input: 5
Output: True
Explanation: 1 * 1 + 2 * 2 = 5

Example 2:

Input: 3
Output: False

代码：

class Solution {
public:
    bool judgeSquareSum(int c) {
        for(int i = 0; i <= sqrt(c); i ++) {
            if(i * i == c) return true;
            int num = c - i * i;
            int t = sqrt(num);
            if(t * t == num) return true;
        }
        return false;
    }
};

#Leetcode# 633. Sum of Square Numbers

标签：and   ++   false   https   class   turn   href   nat   integer   

原文地址：https://www.cnblogs.com/zlrrrr/p/10699786.html