coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/furthest-building-you-can-reach.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1598,
"likes": 1601,
"dislikes": 48,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"45.9K\", \"totalSubmission\": \"102K\", \"totalAcceptedRaw\": 45929, \"totalSubmissionRaw\": 102010, \"acRate\": \"45.0%\"}",
"stats": "{\"totalAccepted\": \"46K\", \"totalSubmission\": \"102.3K\", \"totalAcceptedRaw\": 46044, \"totalSubmissionRaw\": 102276, \"acRate\": \"45.0%\"}",
"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.",