coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/minimum-time-visiting-all-points.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 1157,
"dislikes": 156,
"likes": 1178,
"dislikes": 157,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[1,1],[3,4],[-1,0]]\n[[3,2],[-2,2]]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"112.9K\", \"totalSubmission\": \"142.6K\", \"totalAcceptedRaw\": 112885, \"totalSubmissionRaw\": 142648, \"acRate\": \"79.1%\"}",
"stats": "{\"totalAccepted\": \"114.6K\", \"totalSubmission\": \"144.8K\", \"totalAcceptedRaw\": 114569, \"totalSubmissionRaw\": 144771, \"acRate\": \"79.1%\"}",
"hints": [
"To walk from point A to point B there will be an optimal strategy to walk ?",
"Advance in diagonal as possible then after that go in straight line.",