mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 267,
|
||||
"likes": 268,
|
||||
"dislikes": 48,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Unique Paths\", \"titleSlug\": \"unique-paths\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Path Sum\", \"titleSlug\": \"minimum-path-sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Bomb Enemy\", \"titleSlug\": \"bomb-enemy\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Count Square Submatrices with All Ones\", \"titleSlug\": \"count-square-submatrices-with-all-ones\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"7.7K\", \"totalSubmission\": \"15.4K\", \"totalAcceptedRaw\": 7668, \"totalSubmissionRaw\": 15388, \"acRate\": \"49.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"7.7K\", \"totalSubmission\": \"15.5K\", \"totalAcceptedRaw\": 7710, \"totalSubmissionRaw\": 15452, \"acRate\": \"49.9%\"}",
|
||||
"hints": [
|
||||
"Irrespective of what path the robot takes, it will have to traverse all the rows between startRow and homeRow and all the columns between startCol and homeCol.",
|
||||
"Hence, making any other move other than traversing the required rows and columns will potentially incur more cost which can be avoided."
|
||||
|
Reference in New Issue
Block a user