coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-24 22:38:57 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/max-value-of-equation.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"8.6K\", \"totalAcceptedRaw\": 3310, \"totalSubmissionRaw\": 8604, \"acRate\": \"38.5%\"}",
"stats": "{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"8.6K\", \"totalAcceptedRaw\": 3315, \"totalSubmissionRaw\": 8614, \"acRate\": \"38.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.",