coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41: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/subarray-product-less-than-k.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"257.1K\", \"totalSubmission\": \"549.8K\", \"totalAcceptedRaw\": 257099, \"totalSubmissionRaw\": 549805, \"acRate\": \"46.8%\"}",
"stats": "{\"totalAccepted\": \"257.1K\", \"totalSubmission\": \"549.8K\", \"totalAcceptedRaw\": 257129, \"totalSubmissionRaw\": 549847, \"acRate\": \"46.8%\"}",
"hints": [
"For each j, let opt(j) be the smallest i so that nums[i] * nums[i+1] * ... * nums[j] is less than k. opt is an increasing function."
],