mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 15:01:40 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 277,
|
||||
"dislikes": 368,
|
||||
"likes": 279,
|
||||
"dislikes": 373,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Path Sum\", \"titleSlug\": \"path-sum\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"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\": \"Path Sum III\", \"titleSlug\": \"path-sum-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[113,215,221]\n[113,221]",
|
||||
@@ -46,7 +46,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"19.2K\", \"totalSubmission\": \"32.8K\", \"totalAcceptedRaw\": 19184, \"totalSubmissionRaw\": 32781, \"acRate\": \"58.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"33.1K\", \"totalAcceptedRaw\": 19372, \"totalSubmissionRaw\": 33061, \"acRate\": \"58.6%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "328",
|
||||
|
Reference in New Issue
Block a user