coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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/the-number-of-beautiful-subsets.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"18K\", \"totalSubmission\": \"57.5K\", \"totalAcceptedRaw\": 18037, \"totalSubmissionRaw\": 57512, \"acRate\": \"31.4%\"}",
"stats": "{\"totalAccepted\": \"18.1K\", \"totalSubmission\": \"57.6K\", \"totalAcceptedRaw\": 18071, \"totalSubmissionRaw\": 57567, \"acRate\": \"31.4%\"}",
"hints": [
"Sort the array nums and create another array cnt of size nums[i].",
"Use backtracking to generate all the beautiful subsets. If cnt[nums[i] - k] is positive, then it is impossible to add nums[i] in the subset, and we just move to the next index. Otherwise, it is also possible to add nums[i] in the subset, in this case, increase cnt[nums[i]], and move to the next index.",