coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 13:36:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"7.1K\", \"totalAcceptedRaw\": 3507, \"totalSubmissionRaw\": 7141, \"acRate\": \"49.1%\"}",
"stats": "{\"totalAccepted\": \"3.5K\", \"totalSubmission\": \"7.2K\", \"totalAcceptedRaw\": 3519, \"totalSubmissionRaw\": 7159, \"acRate\": \"49.2%\"}",
"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?"
],