首页 > 其他 > 详细

19.2.12 [LeetCode 69] Sqrt(x)

时间:2019-02-12 22:37:04      阅读:162      评论:0      收藏:0      [点我收藏+]

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.
技术分享图片
 1 class Solution {
 2 public:
 3     int mySqrt(int x) {
 4         int s = 0, e = sqrt(INT_MAX);
 5         while (s <= e) {
 6             int mid = (s + e) / 2;
 7             if (mid*mid <= x) 
 8                 s = mid + 1;
 9             else 
10                 e = mid - 1;
11         }
12         return e;
13     }
14 };
View Code

 

19.2.12 [LeetCode 69] Sqrt(x)

原文:https://www.cnblogs.com/yalphait/p/10367287.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!