coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-09 01:11:42 +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]maximum-profitable-triplets-with-increasing-prices-ii.json
View File

@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"257\", \"totalSubmission\": \"450\", \"totalAcceptedRaw\": 257, \"totalSubmissionRaw\": 450, \"acRate\": \"57.1%\"}",
"stats": "{\"totalAccepted\": \"260\", \"totalSubmission\": \"453\", \"totalAcceptedRaw\": 260, \"totalSubmissionRaw\": 453, \"acRate\": \"57.4%\"}",
"hints": [
"Let's fix the middle chosen item for instance index <code>j</code>.",
"Let’s define an array <code>max_right</code>, where <code>max_right[j]</code> represents the maximum <code>profit[k]</code> for every index <code>k > j</code> such that <code>prices[k] > prices[j]</code>.",