Sqrt(x) 求平方根@LeetCode

最新推荐文章于 2024-04-22 07:30:00 发布

chiiis

最新推荐文章于 2024-04-22 07:30:00 发布

阅读量2.9k

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode LeetCode Redo LeetCode专栏

本文链接：https://blog.youkuaiyun.com/fightforyourdream/article/details/15332269

Leetcode 同时被 3 个专栏收录

153 篇文章

订阅专栏

LeetCode专栏

148 篇文章

订阅专栏

LeetCode Redo

27 篇文章

订阅专栏

本文介绍了如何运用二分查找算法来解决LeetCode中的平方根计算问题。通过不断缩小搜索区间，二分法能够有效地找到x的平方根，其时间复杂度为O(log n)。

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

二分法

package Level4;

/**
 * Sqrt(x)
 * 
 * Implement int sqrt(int x).
 * 
 * Compute and return the square root of x.
 * 
 */
public class S69 {

	public static void main(String[] args) {
		System.out.println(sqrt(2));
	}

	public static int sqrt(int x) {
		double diff = 0.01;		// 误差
		int low = 0;
		int high = x;
		
		while(low <= high){
			// 注意越界！所以用double来存
			double mid = low + (high-low)/2;
			if(Math.abs(mid*mid-x) <= diff){
				return (int)mid;
			}else if(x > mid*mid+diff){
				low = (int)mid+1;
			}else if(x < mid*mid-diff){
				high = (int)mid-1;
			}
		}
		
		// 当找不到时候，这是low,high指针已经交叉，取较小的，即high
		return high;
	}

}

public class Solution {
    public int sqrt(int x) {
        int left = 0, right = x;
        while(left <= right) {
            double mid = left + (right-left)/2;
            double mul = mid * mid;
            if(mul == x){
                return (int)mid;
            } else if(mul < x) {
                left = (int)mid+1;
            } else {
                right = (int)mid-1;
            }
        }
        return right;
    }
}