coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01: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/furthest-building-you-can-reach.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1601,
"dislikes": 48,
"likes": 1645,
"dislikes": 49,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[4,2,7,6,9,14,12]\n5\n1\n[4,12,2,7,3,18,20,3,19]\n10\n2\n[14,3,19,3]\n17\n0",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"46K\", \"totalSubmission\": \"102.3K\", \"totalAcceptedRaw\": 46044, \"totalSubmissionRaw\": 102276, \"acRate\": \"45.0%\"}",
"stats": "{\"totalAccepted\": \"47.6K\", \"totalSubmission\": \"105.7K\", \"totalAcceptedRaw\": 47623, \"totalSubmissionRaw\": 105684, \"acRate\": \"45.1%\"}",
"hints": [
"Assume the problem is to check whether you can reach the last building or not.",
"You'll have to do a set of jumps, and choose for each one whether to do it using a ladder or bricks. It's always optimal to use ladders in the largest jumps.",