coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +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

6
leetcode/originData/minimum-cost-to-change-the-final-value-of-expression.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 153,
"dislikes": 33,
"likes": 156,
"dislikes": 34,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"1&(0|1)\"\n\"(0&0)&(0&0&0)\"\n\"(0|(1|0&1))\"",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.5K\", \"totalSubmission\": \"4.7K\", \"totalAcceptedRaw\": 2500, \"totalSubmissionRaw\": 4672, \"acRate\": \"53.5%\"}",
"stats": "{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"4.8K\", \"totalAcceptedRaw\": 2580, \"totalSubmissionRaw\": 4787, \"acRate\": \"53.9%\"}",
"hints": [
"How many possible states are there for a given expression?",
"Is there a data structure that we can use to solve the problem optimally?"