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

4
leetcode/originData/[no content]maximum-profitable-triplets-with-increasing-prices-i.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 12,
"likes": 13,
"dislikes": 1,
"isLiked": null,
"similarQuestions": "[]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"686\", \"totalSubmission\": \"1.1K\", \"totalAcceptedRaw\": 686, \"totalSubmissionRaw\": 1144, \"acRate\": \"60.0%\"}",
"stats": "{\"totalAccepted\": \"689\", \"totalSubmission\": \"1.2K\", \"totalAcceptedRaw\": 689, \"totalSubmissionRaw\": 1159, \"acRate\": \"59.4%\"}",
"hints": [
"Let's fix the middle chosen item.",
"For a fixed item with an index <code>j</code>, iterate over items with an index <code>k > j</code> such that <code>prices[k] > prices[j]</code>.",