/*****************************************************问题描述*************************************************
Given a positive integer num, write a function which returns True if num is a perfect square else False.
Note: Do not use any built-in library function such as sqrt.
Example 1:
Input: 16
Output: true
Example 2:
Input: 14
Output: false
判断一个数是否是完全平方数
/*****************************************************我的解答*************************************************
/**
* @param {number} num
* @return {boolean}
*/
var isPerfectSquare = function(num) {s
if(num < 0)
{
return false;
}
for(var i = 0; i <= num; i++)
{
if(i * i == num)
{
return true;
}
if(i * i > num)
{
return false;
}
}
};
leetCode刷题记录47_367_Valid Perfect Square
猜你喜欢
转载自blog.csdn.net/gunsmoke/article/details/88218461
今日推荐
周排行