小白笔记-------------------二分搜索算法（再刷一遍）

最新推荐文章于 2025-08-22 08:13:27 发布

原创最新推荐文章于 2025-08-22 08:13:27 发布 · 736 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

算法设计

当前文章被收录于：

算法设计

56 篇文章 0 人学习

订阅专栏查看详情

java

当前文章被收录于：

java

17 篇文章 0 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

本文介绍了一种基于二分搜索算法解决猜数字游戏的方法。玩家需要从1到n中猜测一个由系统选定的数字，每次猜测后系统会反馈数字是高了还是低了。文章详细解释了如何使用二分搜索策略高效找到目标数字。

374. Guess Number Higher or Lower

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 (-1, 1, or 0):

感觉这是个为了二分算法而做的题，啥也不说了贴出来

/* The guess API is defined in the parent class GuessGame.
   @param num, 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 left = 1;
       int right = n;
       int middle;
       while(left <= right){
            middle = left +(right - left) / 2;
           if(guess(middle) == 0){
               return middle;
           }
           if(guess(middle) == -1){
               right = middle - 1;
           }
           if(guess(middle) == 1){
               left = middle + 1;
           }
       }
       return -1;
    }
}