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/maximum-balanced-subsequence-sum.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"4K\", \"totalSubmission\": \"18.2K\", \"totalAcceptedRaw\": 4020, \"totalSubmissionRaw\": 18241, \"acRate\": \"22.0%\"}",
"stats": "{\"totalAccepted\": \"4K\", \"totalSubmission\": \"18.3K\", \"totalAcceptedRaw\": 4023, \"totalSubmissionRaw\": 18259, \"acRate\": \"22.0%\"}",
"hints": [
"Let <code>dp[x]</code> represent the maximum sum of a balanced subsequence ending at <code>x</code>.",
"Rewriting the formula <code>nums[i<sub>j</sub>] - nums[i<sub>j-1</sub>] >= i<sub>j</sub> - i<sub>j-1</sub></code> gives <code>nums[i<sub>j</sub>] - i<sub>j</sub> >= nums[i<sub>j-1</sub>] - i<sub>j-1</sub></code>.",