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

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"15.2K\", \"totalSubmission\": \"39.8K\", \"totalAcceptedRaw\": 15238, \"totalSubmissionRaw\": 39800, \"acRate\": \"38.3%\"}",
"stats": "{\"totalAccepted\": \"15.2K\", \"totalSubmission\": \"39.8K\", \"totalAcceptedRaw\": 15242, \"totalSubmissionRaw\": 39807, \"acRate\": \"38.3%\"}",
"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.",