1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-25 14:58:56 +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>给定一组<strong>正整数,</strong>相邻的整数之间将会进行浮点除法操作。例如,&nbsp;[2,3,4] -&gt; 2 / 3 / 4 。</p>\n\n<p>但是,你可以在任意位置添加任意数目的括号,来改变算数的优先级。你需要找出怎么添加括号,才能得到<strong>最大的</strong>结果,并且返回相应的字符串格式的表达式。<strong>你的表达式不应该含有冗余的括号。</strong></p>\n\n<p><strong>示例:</strong></p>\n\n<pre>\n<strong>输入:</strong> [1000,100,10,2]\n<strong>输出:</strong> &quot;1000/(100/10/2)&quot;\n<strong>解释:</strong>\n1000/(100/10/2) = 1000/((100/10)/2) = 200\n但是以下加粗的括号 &quot;1000/(<strong>(</strong>100/10<strong>)</strong>/2)&quot; 是冗余的,\n因为他们并不影响操作的优先级所以你需要返回 &quot;1000/(100/10/2)&quot;。\n\n其他用例:\n1000/(100/10)/2 = 50\n1000/(100/(10/2)) = 50\n1000/100/10/2 = 0.5\n1000/100/(10/2) = 2\n</pre>\n\n<p><strong>说明:</strong></p>\n\n<ol>\n\t<li>输入数组的长度在 [1, 10] 之间。</li>\n\t<li>数组中每个元素的大小都在 [2, 1000] 之间。</li>\n\t<li>每个测试用例只有一个最优除法解。</li>\n</ol>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 181,
"likes": 182,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"28.1K\", \"totalSubmission\": \"43.1K\", \"totalAcceptedRaw\": 28072, \"totalSubmissionRaw\": 43150, \"acRate\": \"65.1%\"}",
"stats": "{\"totalAccepted\": \"28.3K\", \"totalSubmission\": \"43.6K\", \"totalAcceptedRaw\": 28315, \"totalSubmissionRaw\": 43557, \"acRate\": \"65.0%\"}",
"hints": [],
"solution": null,
"status": null,