coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 22:13:28 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"13.4K\", \"totalAcceptedRaw\": 6855, \"totalSubmissionRaw\": 13399, \"acRate\": \"51.2%\"}",
"stats": "{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"13.4K\", \"totalAcceptedRaw\": 6884, \"totalSubmissionRaw\": 13444, \"acRate\": \"51.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.",