mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 5200,
|
||||
"dislikes": 770,
|
||||
"likes": 5334,
|
||||
"dislikes": 779,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Path Sum II\", \"titleSlug\": \"path-sum-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Binary Tree Maximum Path Sum\", \"titleSlug\": \"binary-tree-maximum-path-sum\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Sum Root to Leaf Numbers\", \"titleSlug\": \"sum-root-to-leaf-numbers\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Path Sum III\", \"titleSlug\": \"path-sum-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Path Sum IV\", \"titleSlug\": \"path-sum-iv\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[5,4,8,11,null,13,4,7,2,null,null,null,1]\n22\n[1,2,3]\n5\n[]\n0",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"842.3K\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 842343, \"totalSubmissionRaw\": 1859705, \"acRate\": \"45.3%\"}",
|
||||
"stats": "{\"totalAccepted\": \"861.6K\", \"totalSubmission\": \"1.9M\", \"totalAcceptedRaw\": 861615, \"totalSubmissionRaw\": 1894818, \"acRate\": \"45.5%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "616",
|
||||
|
Reference in New Issue
Block a user