coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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

4
leetcode/originData/find-maximum-non-decreasing-array-length.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 77,
"likes": 78,
"dislikes": 8,
"isLiked": null,
"similarQuestions": "[]",
@@ -179,7 +179,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"9.9K\", \"totalAcceptedRaw\": 1365, \"totalSubmissionRaw\": 9921, \"acRate\": \"13.8%\"}",
"stats": "{\"totalAccepted\": \"1.4K\", \"totalSubmission\": \"10K\", \"totalAcceptedRaw\": 1376, \"totalSubmissionRaw\": 9997, \"acRate\": \"13.8%\"}",
"hints": [
"Let <code>dp[i]</code> be the maximum number of elements in the increasing sequence after processing the first <code>i</code> elements of the original array.",
"We have <code>dp[0] = 0</code>. <code>dp[i + 1] >= dp[i]</code> (since if we have the solution for the first <code>i</code> elements, we can always merge the last one of the first <code>i + 1</code> elements which is <code>nums[i]</code> into the solution of the first <code>i</code> elements.",