coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 08:51:42 +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/[no content]count-the-number-of-k-free-subsets.json
View File

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"3.6K\", \"totalAcceptedRaw\": 1771, \"totalSubmissionRaw\": 3575, \"acRate\": \"49.5%\"}",
"stats": "{\"totalAccepted\": \"1.8K\", \"totalSubmission\": \"3.6K\", \"totalAcceptedRaw\": 1775, \"totalSubmissionRaw\": 3579, \"acRate\": \"49.6%\"}",
"hints": [
"Split all numbers into several groups, with each group being an arithmetic sequence with a common difference of k.",
"How many K-free subsets are there for each group? This can be solved by dp: dp[i] = dp[i-1] + dp[i-2], meaning if we choose ith element, we cannot choose (i-1)th; otherwise we can choose (i-1)th element.",