mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-02 14:12:17 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>给你一个 <strong>下标从 0 开始</strong> 的正整数数组 <code>w</code> ,其中 <code>w[i]</code> 代表第 <code>i</code> 个下标的权重。</p>\n\n<p>请你实现一个函数 <code>pickIndex</code> ,它可以 <strong>随机地</strong> 从范围 <code>[0, w.length - 1]</code> 内(含 <code>0</code> 和 <code>w.length - 1</code>)选出并返回一个下标。选取下标 <code>i</code> 的 <strong>概率</strong> 为 <code>w[i] / sum(w)</code> 。</p>\n\n<ol>\n</ol>\n\n<ul>\n\t<li>例如,对于 <code>w = [1, 3]</code>,挑选下标 <code>0</code> 的概率为 <code>1 / (1 + 3) = 0.25</code> (即,25%),而选取下标 <code>1</code> 的概率为 <code>3 / (1 + 3) = 0.75</code>(即,<code>75%</code>)。</li>\n</ul>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong>\n[\"Solution\",\"pickIndex\"]\n[[[1]],[]]\n<strong>输出:</strong>\n[null,0]\n<strong>解释:</strong>\nSolution solution = new Solution([1]);\nsolution.pickIndex(); // 返回 0,因为数组中只有一个元素,所以唯一的选择是返回下标 0。</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong>\n[\"Solution\",\"pickIndex\",\"pickIndex\",\"pickIndex\",\"pickIndex\",\"pickIndex\"]\n[[[1,3]],[],[],[],[],[]]\n<strong>输出:</strong>\n[null,1,1,1,1,0]\n<strong>解释:</strong>\nSolution solution = new Solution([1, 3]);\nsolution.pickIndex(); // 返回 1,返回下标 1,返回该下标概率为 3/4 。\nsolution.pickIndex(); // 返回 1\nsolution.pickIndex(); // 返回 1\nsolution.pickIndex(); // 返回 1\nsolution.pickIndex(); // 返回 0,返回下标 0,返回该下标概率为 1/4 。\n\n由于这是一个随机问题,允许多个答案,因此下列输出都可以被认为是正确的:\n[null,1,1,1,1,0]\n[null,1,1,1,1,1]\n[null,1,1,1,0,0]\n[null,1,1,1,0,1]\n[null,1,0,1,0,0]\n......\n诸若此类。\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= w.length <= 10<sup>4</sup></code></li>\n\t<li><code>1 <= w[i] <= 10<sup>5</sup></code></li>\n\t<li><code>pickIndex</code> 将被调用不超过 <code>10<sup>4</sup></code> 次</li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 218,
|
||||
"likes": 220,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Random Pick Index\", \"titleSlug\": \"random-pick-index\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u968f\\u673a\\u6570\\u7d22\\u5f15\"}, {\"title\": \"Random Pick with Blacklist\", \"titleSlug\": \"random-pick-with-blacklist\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u9ed1\\u540d\\u5355\\u4e2d\\u7684\\u968f\\u673a\\u6570\"}, {\"title\": \"Random Point in Non-overlapping Rectangles\", \"titleSlug\": \"random-point-in-non-overlapping-rectangles\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u975e\\u91cd\\u53e0\\u77e9\\u5f62\\u4e2d\\u7684\\u968f\\u673a\\u70b9\"}]",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"37.2K\", \"totalSubmission\": \"77.4K\", \"totalAcceptedRaw\": 37236, \"totalSubmissionRaw\": 77396, \"acRate\": \"48.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"37.4K\", \"totalSubmission\": \"77.7K\", \"totalAcceptedRaw\": 37357, \"totalSubmissionRaw\": 77657, \"acRate\": \"48.1%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
Reference in New Issue
Block a user