coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 16:01:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
leetcode/originData/maximum-balanced-subsequence-sum.json
View File

@@ -11,14 +11,45 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 112,
"dislikes": 5,
"likes": 137,
"dislikes": 7,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Number of Pairs Satisfying Inequality\", \"titleSlug\": \"number-of-pairs-satisfying-inequality\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[3,3,5,6]\n[5,-1,-3,8]\n[-2,-1]",
"categoryTitle": "Algorithms",
"contributors": [],
"topicTags": [],
"topicTags": [
{
"name": "Array",
"slug": "array",
"translatedName": null,
"__typename": "TopicTagNode"
},
{
"name": "Binary Search",
"slug": "binary-search",
"translatedName": null,
"__typename": "TopicTagNode"
},
{
"name": "Dynamic Programming",
"slug": "dynamic-programming",
"translatedName": null,
"__typename": "TopicTagNode"
},
{
"name": "Binary Indexed Tree",
"slug": "binary-indexed-tree",
"translatedName": null,
"__typename": "TopicTagNode"
},
{
"name": "Segment Tree",
"slug": "segment-tree",
"translatedName": null,
"__typename": "TopicTagNode"
}
],
"companyTagStats": null,
"codeSnippets": [
{
@@ -136,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"16.3K\", \"totalAcceptedRaw\": 3287, \"totalSubmissionRaw\": 16345, \"acRate\": \"20.1%\"}",
"stats": "{\"totalAccepted\": \"4K\", \"totalSubmission\": \"18.2K\", \"totalAcceptedRaw\": 4020, \"totalSubmissionRaw\": 18241, \"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>.",