mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 903,
|
||||
"dislikes": 228,
|
||||
"likes": 922,
|
||||
"dislikes": 233,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Decode String\", \"titleSlug\": \"decode-string\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Encode String with Shortest Length\", \"titleSlug\": \"encode-string-with-shortest-length\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Parse Lisp Expression\", \"titleSlug\": \"parse-lisp-expression\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "\"H2O\"\n\"Mg(OH)2\"\n\"K4(ON(SO3)2)2\"",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"44.1K\", \"totalSubmission\": \"85.2K\", \"totalAcceptedRaw\": 44051, \"totalSubmissionRaw\": 85174, \"acRate\": \"51.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"44.7K\", \"totalSubmission\": \"86.4K\", \"totalAcceptedRaw\": 44685, \"totalSubmissionRaw\": 86395, \"acRate\": \"51.7%\"}",
|
||||
"hints": [
|
||||
"To parse formula[i:], when we see a `'('`, we will parse recursively whatever is inside the brackets (up to the correct closing ending bracket) and add it to our count, multiplying by the following multiplicity if there is one.\r\n\r\nOtherwise, we should see an uppercase character: we will parse the rest of the letters to get the name, and add that (plus the multiplicity if there is one.)"
|
||||
],
|
||||
|
Reference in New Issue
Block a user