[Leetcode] SQRT (X)

Implementint sqrt(int x).

Compute and return the square root of X.

In the bipartite method, when an accurate value cannot be obtained, the smaller value is removed (and the closest value is also obtained)

public class Solution {public int sqrt(int x) {    if(x<1) return 0;    int left = 1;    int right = x;    int res = -1;    while(left<=right){    int mid = (left+right)/2;    int comp = x/mid;    if(comp==mid) return mid;    if(comp<mid){    right = mid-1;    }else{    left = mid+1;    res = mid;    }    }    return res;}}

[Leetcode] SQRT (X)