leetcode

0 class Solution {

1 public:

2 int mySqrt(int x) {

3 int low = 1, high = x;

4 while (low <= high) {

5 int mid = low + (high - low) / 2;

6 if (mid == x / mid)

7 return mid;

8 else if (mid > x / mid)

9 high = mid - 1;

10 else

11 low = mid + 1;

12 }

13 return high;

14 }

15 };