coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11:41 +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/originData/[no content]count-strictly-increasing-subarrays.json
View File

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 5659, \"totalSubmissionRaw\": 7464, \"acRate\": \"75.8%\"}",
"stats": "{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"7.5K\", \"totalAcceptedRaw\": 5663, \"totalSubmissionRaw\": 7469, \"acRate\": \"75.8%\"}",
"hints": [
"Find the number of strictly increasing subarrays that end at a specific index. Can you calculate that for each index from 0 to n - 1?",
"The answer will be the sum of the number of subarrays that end at each index."