Leetcode 69. SQRT (x)

SQRT (x)Total accepted:99997 Total submissions:388728 difficulty:medium

Implement int sqrt(int x) .

Compute and return the square root of X.

Idea: You can use the SQRT function directly. But in fact, this is a two-point search.

Code:
The simplest method:

1 class Solution {2public:3     int mysqrt (int x) {//15792052744         int half= ( int ) sqrt (x); 5         return half; 6     }7 };

Two-point search:

1 classSolution {2  Public:3     intMYSQRT (intx) {//15792052744         if(x<=1){5             returnx;6         }7         intleft=1, Right=x,mid;//left closed right open8          while(left<Right ) {9mid=left+ (Right-left)/2;//Direct use (high + low)/2 may cause overflowTen             if(x/mid>=mid) { OneLeft=mid+1; A             } -             Else{ -right=mid; the             } -         } -         returnleft-1; -     } +};

Leetcode 69. SQRT (x)