coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-09 09:21:40 +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

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

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11K\", \"totalSubmission\": \"20.5K\", \"totalAcceptedRaw\": 11008, \"totalSubmissionRaw\": 20519, \"acRate\": \"53.6%\"}",
"stats": "{\"totalAccepted\": \"11K\", \"totalSubmission\": \"20.5K\", \"totalAcceptedRaw\": 11011, \"totalSubmissionRaw\": 20524, \"acRate\": \"53.6%\"}",
"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.",