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

4
leetcode/originData/longest-non-decreasing-subarray-from-two-arrays.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 514,
"likes": 515,
"dislikes": 10,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Russian Doll Envelopes\", \"titleSlug\": \"russian-doll-envelopes\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Maximum Length of Pair Chain\", \"titleSlug\": \"maximum-length-of-pair-chain\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"18.1K\", \"totalSubmission\": \"64.6K\", \"totalAcceptedRaw\": 18069, \"totalSubmissionRaw\": 64588, \"acRate\": \"28.0%\"}",
"stats": "{\"totalAccepted\": \"18.1K\", \"totalSubmission\": \"64.7K\", \"totalAcceptedRaw\": 18089, \"totalSubmissionRaw\": 64654, \"acRate\": \"28.0%\"}",
"hints": [
"Consider using dynamic programming.",
"Let dp[i][0] (dp[i][1]) be the length of the longest non-decreasing ending with nums1[i] (nums2[i]).",