LeetCode 374 Guess Number Higher or Lower

本文介绍了一种通过二分查找解决猜数字游戏的方法。玩家需要从1到n中猜出预设的数字,每次猜测都会得到提示:数字是更高、更低还是正确。文章详细解释了如何使用二分查找算法来高效地找到目标数字。

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

We are playing the Guess Game. The game is as follows:

I pick a number from 1 to n. You have to guess which number I picked.

Every time you guess wrong, I'll tell you whether the number is higher or lower.

You call a pre-defined API guess(int num) which returns 3 possible results (-11, or 0):

-1 : My number is lower
 1 : My number is higher
 0 : Congrats! You got it!

Example:

n = 10, I pick 6.

Return 6.

还是二分查找啦。若是查找某个数,猜某个数,大多情况下都是二分查找。

	/* The guess API is defined in the parent class GuessGame.
   @param n, your guess
   @return -1 if my number is lower, 1 if my number is higher, otherwise return 0
      int guess(int num); */

	public class Solution extends GuessGame {
		public int guessNumber(int n) {
			int low = 1, high = n, result;
			while (true) {
				result = low + (high - low) / 2;
				if (guess(result) == 0) return result;
				else if (guess(result) == 1) {
					low = result + 1;
				} else high = result - 1;
			}
		}
	}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值