mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
56 lines
1.5 KiB
HTML
56 lines
1.5 KiB
HTML
|
<p>猜数字游戏的规则如下:</p>
|
|||
|
|
|||
|
<ul>
|
|||
|
<li>每轮游戏,我都会从 <strong>1</strong> 到 <em><strong>n</strong></em> 随机选择一个数字。 请你猜选出的是哪个数字。</li>
|
|||
|
<li>如果你猜错了,我会告诉你,你猜测的数字比我选出的数字是大了还是小了。</li>
|
|||
|
</ul>
|
|||
|
|
|||
|
<p>你可以通过调用一个预先定义好的接口 <code>int guess(int num)</code> 来获取猜测结果,返回值一共有 3 种可能的情况(<code>-1</code>,<code>1</code> 或 <code>0</code>):</p>
|
|||
|
|
|||
|
<ul>
|
|||
|
<li>-1:我选出的数字比你猜的数字小 <code>pick < num</code></li>
|
|||
|
<li>1:我选出的数字比你猜的数字大 <code>pick > num</code></li>
|
|||
|
<li>0:我选出的数字和你猜的数字一样。恭喜!你猜对了!<code>pick == num</code></li>
|
|||
|
</ul>
|
|||
|
|
|||
|
<p>返回我选出的数字。</p>
|
|||
|
|
|||
|
<p> </p>
|
|||
|
|
|||
|
<p><strong>示例 1:</strong></p>
|
|||
|
|
|||
|
<pre>
|
|||
|
<strong>输入:</strong>n = 10, pick = 6
|
|||
|
<strong>输出:</strong>6
|
|||
|
</pre>
|
|||
|
|
|||
|
<p><strong>示例 2:</strong></p>
|
|||
|
|
|||
|
<pre>
|
|||
|
<strong>输入:</strong>n = 1, pick = 1
|
|||
|
<strong>输出:</strong>1
|
|||
|
</pre>
|
|||
|
|
|||
|
<p><strong>示例 3:</strong></p>
|
|||
|
|
|||
|
<pre>
|
|||
|
<strong>输入:</strong>n = 2, pick = 1
|
|||
|
<strong>输出:</strong>1
|
|||
|
</pre>
|
|||
|
|
|||
|
<p><strong>示例 4:</strong></p>
|
|||
|
|
|||
|
<pre>
|
|||
|
<strong>输入:</strong>n = 2, pick = 2
|
|||
|
<strong>输出:</strong>2
|
|||
|
</pre>
|
|||
|
|
|||
|
<p> </p>
|
|||
|
|
|||
|
<p><strong>提示:</strong></p>
|
|||
|
|
|||
|
<ul>
|
|||
|
<li><code>1 <= n <= 2<sup>31</sup> - 1</code></li>
|
|||
|
<li><code>1 <= pick <= n</code></li>
|
|||
|
</ul>
|