How to compute the square root of an integer?

最新推荐文章于 2025-01-13 15:16:10 发布

gy211208

最新推荐文章于 2025-01-13 15:16:10 发布

阅读量702

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/gy211208/article/details/16815559

本文详细解析了一个二分查找问题实例，通过LeetCode测试代码的实现，揭示了如何高效解决此类问题，从理解核心算法到优化代码逻辑，提供了一步步深入的分析。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

This is a binary search problem, but it's very easy to get the wrong answer...

Here is the code I wrote for leetcode testing. There still long way to go to understand this 100%...

public class Solution {
   public int sqrt(int x) {
        if(x ==0 || x== 1) return x;
        if(x < 0) return -1;
        
        long start = 0;
        long end = x;
     
        while(end-start >= 0){
            long mid = start + (end - start)/2;
            long midsqr = mid * mid;
            
            if(midsqr == x)
                return (int)mid;
            else if(midsqr < x){
                start = mid+1;
            }
            else if(midsqr > x){
                end = mid - 1;
            }
        }
        return (int) end;
        
    }
}