33. Sum of Square Numbers - Jake blog - Java coding practice log (2017)" /> 33. Sum of Square Numbers - Jake blog - Java coding practice log (2017)" />

633. 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 boolean judgeSquareSum(int c) { if(c == 1) return true; for(int i=0;i<=Math.sqrt(c);i++){ if (Math.floor(Math.sqrt(c-i*i)) == Math.sqrt(c-i*i)) return true; } return false; } }

This siteOriginal articleAll follow "Attribution-NonCommercial-ShareAlike 4.0 License (CC BY-NC-SA 4.0)Please retain the following annotations when sharing or adapting:

Original author:Jake Tao,source:「633. Sum of Square Numbers」

150
0 0 150

Further Reading

Post a reply

Log inYou can only comment after that.
Share this page
Back to top