coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/minimize-result-by-adding-parentheses-to-expression.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.8K\", \"totalSubmission\": \"15.6K\", \"totalAcceptedRaw\": 9845, \"totalSubmissionRaw\": 15568, \"acRate\": \"63.2%\"}",
"stats": "{\"totalAccepted\": \"9.8K\", \"totalSubmission\": \"15.6K\", \"totalAcceptedRaw\": 9846, \"totalSubmissionRaw\": 15569, \"acRate\": \"63.2%\"}",
"hints": [
"The maximum length of expression is very low. We can try every possible spot to place the parentheses.",
"Every possibility of expression is of the form a * (b + c) * d where a, b, c, d represent integers. Note the edge cases where a and/or d do not exist, in which case use 1 instead of them."