LeetCode367. Valid Perfect Square

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

参考资料：here。

我们可以使用二分查找完成。

class Solution {
public:
	bool isPerfectSquare(int num) {
		if (num == 0) return false;
		if (num == 1) return true;
		int left = 0, right = num / 2;
		while (left <= right) {
			long mid = (left + right) / 2;
			long tmp = mid * mid;
			if (tmp == num) return true;
			else if (tmp > num) right = mid-1;
			else left = mid+1;
		}
		return false;
	}
};