[leetcode.com]算法题目

Implement int sqrt(int x).

Compute and return the square root of x.

class Solution {
public:
    int sqrt(int x) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(x<=0) return 0;
        if(x==1) return 1;
        int small=0;
        int large=x;
        int temp=x/2;
        while(small<large){
            int a = x/temp;
            int b = x/(temp+1);
            if (a==temp) return a;
            if (b==temp+1) return b;
            if(temp<a && temp+1>b)
                return temp;
            else if(temp<a && temp+1<b){
                small=temp+1;
                temp = (small+large)/2;
            }else {
                large = temp;
                temp = (small+large)/2;
            }
        }
        return -1;
    }
};

思路：需要在O(log n)时间内实现，并且注意用除法，防止两个int型的数相乘超过int的范围。