[leetcode] 367. Valid Perfect Square 解题报告

题目链接: https://leetcode.com/problems/valid-perfect-square/

Given a positive integer num, write a function which returns True if num is a perfect square else False.

Example 1:

Input: 16
Returns: True

Example 2:

Input: 14
Returns: False

思路: 二分查找即可. 话说linkedin好像又开始招人了, 可能前段时间被微软收购之后又有钱了, 哈哈! 

代码如下:

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