1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 21:46:46 +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>arr</code>,找到 <code>min(b)</code> 的总和,其中 <code>b</code> 的范围为 <code>arr</code> 的每个(连续)子数组。</p>\n\n<p>由于答案可能很大,因此<strong> 返回答案模 <code>10^9 + 7</code></strong> 。</p>\n\n<p> </p>\n\n<p><strong>示例 1</strong></p>\n\n<pre>\n<strong>输入:</strong>arr = [3,1,2,4]\n<strong>输出:</strong>17\n<strong>解释:\n</strong>子数组为<strong> </strong>[3][1][2][4][3,1][1,2][2,4][3,1,2][1,2,4][3,1,2,4]。 \n最小值为 3124112111和为 17。</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre>\n<strong>输入:</strong>arr = [11,81,94,43,3]\n<strong>输出:</strong>444\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= arr.length <= 3 * 10<sup>4</sup></code></li>\n\t<li><code>1 <= arr[i] <= 3 * 10<sup>4</sup></code></li>\n</ul>\n\n<p> </p>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 322,
"likes": 332,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"14.5K\", \"totalSubmission\": \"44.2K\", \"totalAcceptedRaw\": 14518, \"totalSubmissionRaw\": 44201, \"acRate\": \"32.8%\"}",
"stats": "{\"totalAccepted\": \"15.3K\", \"totalSubmission\": \"46.2K\", \"totalAcceptedRaw\": 15251, \"totalSubmissionRaw\": 46176, \"acRate\": \"33.0%\"}",
"hints": [],
"solution": null,
"status": null,