coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 14:12:17 +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/closest-subsequence-sum.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"8.9K\", \"totalAcceptedRaw\": 3837, \"totalSubmissionRaw\": 8950, \"acRate\": \"42.9%\"}",
"stats": "{\"totalAccepted\": \"3.8K\", \"totalSubmission\": \"9K\", \"totalAcceptedRaw\": 3845, \"totalSubmissionRaw\": 8960, \"acRate\": \"42.9%\"}",
"hints": [
"The naive solution is to check all possible subsequences. This works in O(2^n).",
"Divide the array into two parts of nearly is equal size.",