coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/longest-arithmetic-subsequence-of-given-difference.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 952,
"dislikes": 42,
"likes": 988,
"dislikes": 43,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,3,4]\n1\n[1,3,5,7]\n1\n[1,5,7,8,5,3,4,2,1]\n-2",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"45.2K\", \"totalSubmission\": \"88.6K\", \"totalAcceptedRaw\": 45212, \"totalSubmissionRaw\": 88594, \"acRate\": \"51.0%\"}",
"stats": "{\"totalAccepted\": \"47.2K\", \"totalSubmission\": \"91.8K\", \"totalAcceptedRaw\": 47154, \"totalSubmissionRaw\": 91843, \"acRate\": \"51.3%\"}",
"hints": [
"Use dynamic programming.",
"Let dp[i] be the maximum length of a subsequence of the given difference whose last element is i.",