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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/remove-outermost-parentheses.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 1212,
"dislikes": 1157,
"likes": 1217,
"dislikes": 1159,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"(()())(())\"\n\"(()())(())(()(()))\"\n\"()()\"",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"167.3K\", \"totalSubmission\": \"209.7K\", \"totalAcceptedRaw\": 167285, \"totalSubmissionRaw\": 209652, \"acRate\": \"79.8%\"}",
"stats": "{\"totalAccepted\": \"167.5K\", \"totalSubmission\": \"209.9K\", \"totalAcceptedRaw\": 167458, \"totalSubmissionRaw\": 209897, \"acRate\": \"79.8%\"}",
"hints": [
"Can you find the primitive decomposition? The number of ( and ) characters must be equal."
],