367. 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
Returns: True

Example 2:

Input: 14
Returns: False

class Solution {
    public boolean isPerfectSquare(int x) {
        long left=1,right=x/2,mid,su;
        if (x<1) return false;
        if (x==1) return true;
        while(left<=right){
            mid=left+(right-left)/2;
            su=mid*mid;
            if (x==su) return true;
            else if (su>x) right=mid-1;
            else left=mid+1;
        }
        return false;
    }
}//同样采用二分搜索的方法，从1到x/2.但是需要定义类型为long型