LintCode刷题141：求Sqrt(x)

今天的题目是LintCode的第141题：求Sqrt(x)

题目描述链接

Implement int sqrt(int x).

Example
Example 1:
	Input:  0
	Output: 0


Example 2:
	Input:  3
	Output: 1
	
	Explanation:
	return the largest integer y that y*y <= x. 
	
Example 3:
	Input:  4
	Output: 2

这题可以使用二分查找法，如果中间数mid的平方大于x，则在比mid小的数中查找，否则在比mid大的部分查找，java实现如下：

public class Solution {
    /**
     * @param x: An integer
     * @return: The sqrt of x
     */
    public int sqrt(int x) {
        // write your code here
        if (x == 0 || x == 1){
            return x;
        }
        int start = 1, end = x;
        while(start + 1 < end) {
            int mid = start + (end - start) / 2;
            if (mid < x / mid) {
                start = mid;
            }else if(mid > x / mid) {
                end = mid;
            }else{
                return mid;
            }
        }
        if (start * start <= x){
            return start;
        }else{
            return end;
        }
    }
}