1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>给定一个数组 <code>A[0,1,…,n-1]</code>,请构建一个数组 <code>B[0,1,…,n-1]</code>,其中 <code>B[i]</code> 的值是数组 <code>A</code> 中除了下标 <code>i</code> 以外的元素的积, 即 <code>B[i]=A[0]×A[1]××A[i-1]×A[i+1]××A[n-1]</code>。不能使用除法。</p>\n\n<p> </p>\n\n<p><strong>示例:</strong></p>\n\n<pre>\n<strong>输入:</strong> [1,2,3,4,5]\n<strong>输出:</strong> [120,60,40,30,24]</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li>所有元素乘积之和不会溢出 32 位整数</li>\n\t<li><code>a.length <= 100000</code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 213,
"likes": 222,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"98.4K\", \"totalSubmission\": \"163.6K\", \"totalAcceptedRaw\": 98395, \"totalSubmissionRaw\": 163600, \"acRate\": \"60.1%\"}",
"stats": "{\"totalAccepted\": \"103.9K\", \"totalSubmission\": \"173.2K\", \"totalAcceptedRaw\": 103892, \"totalSubmissionRaw\": 173217, \"acRate\": \"60.0%\"}",
"hints": [],
"solution": null,
"status": null,