mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-13 03:11:42 +08:00
存量题库数据更新
This commit is contained in:
@@ -38,7 +38,7 @@ solution.pick(); // 返回 4
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= n <= 10<sup>9</sup></code></li>
|
||||
<li><code>0 <= blacklist.length <- min(10<sup>5</sup>, n - 1)</code></li>
|
||||
<li><code>0 <= blacklist.length <= min(10<sup>5</sup>, n - 1)</code></li>
|
||||
<li><code>0 <= blacklist[i] < n</code></li>
|
||||
<li><code>blacklist</code> 中所有值都 <strong>不同</strong></li>
|
||||
<li> <code>pick</code> 最多被调用 <code>2 * 10<sup>4</sup></code> 次</li>
|
||||
|
Reference in New Issue
Block a user