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/valid-mountain-array.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 2072,
"dislikes": 145,
"likes": 2073,
"dislikes": 144,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Number of Removals to Make Mountain Array\", \"titleSlug\": \"minimum-number-of-removals-to-make-mountain-array\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[2,1]\n[3,5,5]\n[0,3,2,1]",
@@ -119,7 +119,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"283K\", \"totalSubmission\": \"837.3K\", \"totalAcceptedRaw\": 283042, \"totalSubmissionRaw\": 837262, \"acRate\": \"33.8%\"}",
"stats": "{\"totalAccepted\": \"283.4K\", \"totalSubmission\": \"838.4K\", \"totalAcceptedRaw\": 283388, \"totalSubmissionRaw\": 838394, \"acRate\": \"33.8%\"}",
"hints": [
"It's very easy to keep track of a monotonically increasing or decreasing ordering of elements. You just need to be able to determine the start of the valley in the mountain and from that point onwards, it should be a valley i.e. no mini-hills after that. Use this information in regards to the values in the array and you will be able to come up with a straightforward solution."
],