mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-08 08:51:42 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 1885,
|
||||
"dislikes": 59,
|
||||
"likes": 1939,
|
||||
"dislikes": 60,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Number of Islands\", \"titleSlug\": \"number-of-islands\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Graph Valid Tree\", \"titleSlug\": \"graph-valid-tree\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Number of Provinces\", \"titleSlug\": \"number-of-provinces\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Paths in Maze That Lead to Same Room\", \"titleSlug\": \"paths-in-maze-that-lead-to-same-room\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "5\n[[0,1],[1,2],[3,4]]\n5\n[[0,1],[1,2],[2,3],[3,4]]",
|
||||
@@ -46,7 +46,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"239.2K\", \"totalSubmission\": \"392.9K\", \"totalAcceptedRaw\": 239221, \"totalSubmissionRaw\": 392927, \"acRate\": \"60.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"246.2K\", \"totalSubmission\": \"403.2K\", \"totalAcceptedRaw\": 246162, \"totalSubmissionRaw\": 403159, \"acRate\": \"61.1%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "1125",
|
||||
|
Reference in New Issue
Block a user