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

4
leetcode/originData/number-of-smooth-descent-periods-of-a-stock.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 307,
"likes": 308,
"dislikes": 10,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Subarray Product Less Than K\", \"titleSlug\": \"subarray-product-less-than-k\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Number of Valid Subarrays\", \"titleSlug\": \"number-of-valid-subarrays\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"17.2K\", \"totalSubmission\": \"31.3K\", \"totalAcceptedRaw\": 17233, \"totalSubmissionRaw\": 31263, \"acRate\": \"55.1%\"}",
"stats": "{\"totalAccepted\": \"17.3K\", \"totalSubmission\": \"31.4K\", \"totalAcceptedRaw\": 17295, \"totalSubmissionRaw\": 31356, \"acRate\": \"55.2%\"}",
"hints": [
"Any array is a series of adjacent longest possible smooth descent periods. For example, [5,3,2,1,7,6] is [5] + [3,2,1] + [7,6].",
"Think of a 2-pointer approach to traverse the array and find each longest possible period.",