[LeetCode] 69. Sqrt(x) 求平方根

Implement int sqrt(int x).

Compute and return the square root of x.

求一個數的平方根。

解法：二分法，迭代循環在x范圍內找中間值mid，然后判斷mid * mid和x，如果mid  > x/mid（不要寫成middle*middle==x，會溢出），說明這個數大了，就保留左邊，right = mid -1。否則保留右邊, left = mid + 1。直到left > right結束循環，返回left - 1。因為當x>2時，x/2的平方一定大於x，不可能是平方根，右指針可以從x/2開始。

Java:

public class Solution {    
    public int sqrt(int x) {    
        if(x<=1) {    
            return x;    
        }    
            
        int begin = 1;    
        int end = x;    
        int middle = 0;    
        while(begin<=end) {    
            mid = begin + (end - begin)/2;     
            if(middle == x/mid) {    
                return mid;    
            } else {    
                if (middle < x/mid) {    
                    begin = mid + 1;    
                } else {    
                    end = mid - 1;    
                }    
            }    
                
        }       
        return end;    
    }    
} 　

Python:

class Solution(object):
    def mySqrt(self, x):
        """
        :type x: int
        :rtype: int
        """
        if x < 2:
            return x
        
        left, right = 1, x // 2
        while left <= right:
            mid = left + (right - left) // 2
            if mid > x / mid:
                right = mid - 1
            else:
                left = mid + 1

        return left - 1

C++:

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

　

類似題目：

[LeetCode] 50. Pow(x, n) 求x的n次方　

All LeetCode Questions List 題目匯總