coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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/max-value-of-equation.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"40.6K\", \"totalSubmission\": \"91.1K\", \"totalAcceptedRaw\": 40569, \"totalSubmissionRaw\": 91066, \"acRate\": \"44.5%\"}",
"stats": "{\"totalAccepted\": \"40.6K\", \"totalSubmission\": \"91.1K\", \"totalAcceptedRaw\": 40570, \"totalSubmissionRaw\": 91069, \"acRate\": \"44.5%\"}",
"hints": [
"Use a priority queue to store for each point i, the tuple [yi-xi, xi]",
"Loop through the array and pop elements from the heap if the condition xj - xi > k, where j is the current index and i is the point on top the queue.",