633. Sum of Square Numbers

最新推荐文章于 2020-08-06 03:03:47 发布

喜欢恋着风

最新推荐文章于 2020-08-06 03:03:47 发布

阅读量189

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u010150046/article/details/75042306

版权

leetcode 专栏收录该内容

99 篇文章 0 订阅

订阅专栏

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

bool judgeSquareSum(int c) {
    if (c == 0)return true;
    int high = sqrt(c);
    for (int low = 0, p = high; low <= high && p >= 0;){
        int sum = pow(low, 2) + pow(p, 2);
        if (sum < c)low++;
        else if (sum > c)p--;
        else return true;
    }
    return false;
}