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/ways-to-express-an-integer-as-sum-of-powers.json
View File

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"15.6K\", \"totalSubmission\": \"46.9K\", \"totalAcceptedRaw\": 15588, \"totalSubmissionRaw\": 46892, \"acRate\": \"33.2%\"}",
"stats": "{\"totalAccepted\": \"15.6K\", \"totalSubmission\": \"46.9K\", \"totalAcceptedRaw\": 15594, \"totalSubmissionRaw\": 46920, \"acRate\": \"33.2%\"}",
"hints": [
"You can use dynamic programming, where dp[k][j] represents the number of ways to express k as the sum of the x-th power of unique positive integers such that the biggest possible number we use is j.",
"To calculate dp[k][j], you can iterate over the numbers smaller than j and try to use each one as a power of x to make our sum k."