#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
using namespace std;
/*
问题:
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
Returns: True
Example 2:
Input: 14
Returns: False
分析:给定一个正整数,判定它是否是一个完全平方数。不能使用内置的sqrt。
暴力破解:让i从1开始遍历判断数i*i是否等于给定数,如果i*i < 给定数,i累加;
如果i*i = 给定数,找到;i*i > 给定数,说明不是。
在此基础上可以优化为二分搜索。
让i每次翻倍查找。
如果初始令low = 1 , high = num
mid * mid > num,说明mid大了,high = mid - 1
mid * mid = num,找到了,返回true
mid * mid < num, 说明mid小了,low = mid + 1
时间复杂度为O(logN)
输入:
1
16
14
输出:
true
true
false
关键:
1 在此基础上可以优化为二分搜索。
让i每次翻倍查找。
如果初始令low = 1 , high = num
mid * mid > num,说明mid大了,high = mid - 1
mid * mid = num,找到了,返回true
mid * mid < num, 说明mid小了,low = mid + 1
*/
class Solution {
public:
bool isPerfectSquare(int num) {
int low = 1;
int high = num;
long long mid;
long long result;
while(low < high)
{
mid = (long long)(low + (high - low) / 2);
result = mid * mid;
if(result > num)
{
high = mid - 1;
}
else if(result < num)
{
low = mid + 1;
}
else
{
return true;
}
}
result = (long long) low * (long long) low;
if(result == num)
{
return true;
}
else
{
return false;
}
}
};
void process()
{
int num;
Solution solution;
while(cin >> num )
{
bool result = solution.isPerfectSquare(num);
if(result)
{
cout << "true" << endl;
}
else
{
cout << "false" << endl;
}
}
}
int main(int argc , char* argv[])
{
process();
getchar();
return 0;
}
leecode 解题总结:367. Valid Perfect Square
最新推荐文章于 2023-05-01 13:06:21 发布