LeetCode-Sqrt(x)

int sqrt(int x)

public class Solution {
    public int sqrt(int x) {
        if(x<=1) {
            return x;
        }
        int left=1,closeLeft=0,middle,right=x/2;
        while(left<=right) {
            middle=left+(right-left)/2;
            if(x/middle>middle) {
                left=middle+1;
                closeLeft=middle;
            }else if(x/middle<middle) {
                right=middle-1;
            }else {
                return middle;
            }
        }
        return closeLeft;
    }
}