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-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

2
leetcode/originData/falling-squares.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"19.2K\", \"totalSubmission\": \"43.9K\", \"totalAcceptedRaw\": 19196, \"totalSubmissionRaw\": 43899, \"acRate\": \"43.7%\"}",
"stats": "{\"totalAccepted\": \"19.2K\", \"totalSubmission\": \"43.9K\", \"totalAcceptedRaw\": 19206, \"totalSubmissionRaw\": 43918, \"acRate\": \"43.7%\"}",
"hints": [
"If positions = [[10, 20], [20, 30]], this is the same as [[1, 2], [2, 3]]. Currently, the values of positions are very large. Can you generalize this approach so as to make the values in positions manageable?"
],