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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/minimum-subsequence-in-non-increasing-order.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 337,
"dislikes": 373,
"likes": 338,
"dislikes": 374,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Count Hills and Valleys in an Array\", \"titleSlug\": \"count-hills-and-valleys-in-an-array\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[4,3,10,9,8]\n[4,4,7,6,7]\n[6]",
@@ -131,7 +131,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"48.8K\", \"totalSubmission\": \"67.7K\", \"totalAcceptedRaw\": 48836, \"totalSubmissionRaw\": 67676, \"acRate\": \"72.2%\"}",
"stats": "{\"totalAccepted\": \"48.9K\", \"totalSubmission\": \"67.8K\", \"totalAcceptedRaw\": 48912, \"totalSubmissionRaw\": 67766, \"acRate\": \"72.2%\"}",
"hints": [
"Sort elements and take each element from the largest until accomplish the conditions."
],