#Leetcode# 633. Sum of Square Numbers

Posted 丧心病狂工科女

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了#Leetcode# 633. Sum of Square Numbers相关的知识,希望对你有一定的参考价值。

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的主要内容,如果未能解决你的问题,请参考以下文章

LeetCode 633. Sum of Square Numbers

[leetcode]633. Sum of Square Numbers

633. Sum of Square Numbers

633. Sum of Square Numbers

633. Sum of Square Numbers

leecode题型整理之双指针