LeetCode Sqrt(x)

Implement int sqrt(int x).

Compute and return the square root of x.

思路：二分求解。

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

			return right;
		}
};

LeetCode Sqrt(x)

原文：http://blog.csdn.net/u011345136/article/details/44831759