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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"24.9K\", \"totalSubmission\": \"55.6K\", \"totalAcceptedRaw\": 24910, \"totalSubmissionRaw\": 55598, \"acRate\": \"44.8%\"}",
"stats": "{\"totalAccepted\": \"24.9K\", \"totalSubmission\": \"55.6K\", \"totalAcceptedRaw\": 24911, \"totalSubmissionRaw\": 55600, \"acRate\": \"44.8%\"}",
"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?"
],