Leetcode374. 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):

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

Example:

    n = 10, I pick 6.

    Return 6.

题目含义:

系统在1到n之间随机选择一个数字,让我们猜这个数字,我们猜的比真实的数大时返回1,小于真实的数时返回-1,相等返回0.

解题思路:

这道题属于典型的二分法,对于1到n这n个数,都是进行有序的排列的,那么我们可以直接套用之前二分的公式进行实现。

具体实现:

/* 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 start = 1;
            int end = n;
            while (start + 1 < end) {
                int mid = start + (end - start)/2;
                if (guess(mid) == 0) {
                    return mid;
                } else if (guess(mid) == -1) {
                    end = mid;
                } else if (guess(mid) == 1) {
                    start = mid;
                }
            }
            if (guess(start) == 0) {
                return start;
            }
            if (guess(end) == 0) {
                return end;
            }
            return -1;
            }
        }
    }   

时间复杂度为O(logn),空间复杂度O(1)。

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值