问题描述
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:
Input: 5
Output: True
Explanation: 1 * 1 + 2 * 2 = 5
Input: 3
Output: False
思路：通过判断一个整数对1求模是否为0来判断一个数是否为整数。将双层循环变为一层
/**
* @param {number} c
* @return {boolean}
*/
var judgeSquareSum = function(c) {
for(var i = 0; i*i <= c; i++){
var val = Math.sqrt(c-i*i);
if(val%1 === 0){
return true;
}
}
return false;
};
问题描述Given a non-negative integer c, your task is to decid...
Given a non-negative integer c, your task is to decide wh...
LeetCode: Sum of Square Numbers Given a non-negative inte...
原题 LintCode 697. Check Sum of Square Numbers Description ...
LeetCode 0633. Sum of Square Numbers平方数之和【Easy】【Python】【双...
题目地址 https://leetcode.com/problems/sum-of-square-numbers/...
leetcode 633. Sum of Square Numbers 这是一道easy题，但是在leetcode...
two sum 的换壳题 ，只是把原有在数组有序下相加为定值变成了平方的和相加为定值。
一、sum Return the sum of a sequence of numbers (NOT string...
【题目描述】给定一个非负整数 c ，你要判断是否存在两个整数 a 和 b，使得 a^2 + b^2 = c。 【示...
本文标题：Day.12 Sum of Square Numbers(63
本文链接：https://www.haomeiwen.com/subject/gehkvxtx.html
网友评论