leetcode 随笔 Sqrt(x)

Implement int sqrt(int x).

Compute and return the square root of x, where x is guaranteed to be a non-negative integer.

Since the return type is an integer, the decimal digits are truncated and only the integer part of the result is returned.

Example 1:

Input: 4
Output: 2

Example 2:

Input: 8
Output: 2
Explanation: The square root of 8 is 2.82842..., and since 
             the decimal part is truncated, 2 is returned.

实现sqrt(x) 返回值为int

--这道题leetcode中的测试样例中没有考虑 x>2^16的情况

最省事的办法还是二分法

class Solution {
public:
	int mySqrt(int x) {
		long long l = 1, r = x;
		while (1)
		{
			if (((l + r) / 2) * ((l + r) / 2) <= x && ((l + r+2) / 2) * ((l + r+2) / 2)>x) return (l + r) / 2;
			else if (((l + r) / 2) * ((l + r) / 2)<x) l = (l + r) / 2;
			else r = (l + r) / 2;
		}
		return -1;
	}
};