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": true,
|
||||
"difficulty": "Hard",
|
||||
"likes": 861,
|
||||
"dislikes": 68,
|
||||
"likes": 878,
|
||||
"dislikes": 71,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Shortest Distance from All Buildings\", \"titleSlug\": \"shortest-distance-from-all-buildings\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Minimum Moves to Equal Array Elements II\", \"titleSlug\": \"minimum-moves-to-equal-array-elements-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "[[1,0,0,0,1],[0,0,0,0,0],[0,0,1,0,0]]\n[[1,1]]",
|
||||
@@ -46,7 +46,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"57.3K\", \"totalSubmission\": \"96.4K\", \"totalAcceptedRaw\": 57256, \"totalSubmissionRaw\": 96407, \"acRate\": \"59.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"58K\", \"totalSubmission\": \"97.7K\", \"totalAcceptedRaw\": 58005, \"totalSubmissionRaw\": 97651, \"acRate\": \"59.4%\"}",
|
||||
"hints": [
|
||||
"Try to solve it in one dimension first. How can this solution apply to the two dimension case?"
|
||||
],
|
||||
|
Reference in New Issue
Block a user