coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 771,
"dislikes": 29,
"likes": 783,
"dislikes": 30,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Count Pairs in Two Arrays\", \"titleSlug\": \"count-pairs-in-two-arrays\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[[1,3],[2,0],[5,10],[6,-10]]\n1\n[[0,0],[3,0],[9,2]]\n3",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"29.2K\", \"totalSubmission\": \"62.4K\", \"totalAcceptedRaw\": 29222, \"totalSubmissionRaw\": 62367, \"acRate\": \"46.9%\"}",
"stats": "{\"totalAccepted\": \"29.8K\", \"totalSubmission\": \"63.6K\", \"totalAcceptedRaw\": 29800, \"totalSubmissionRaw\": 63559, \"acRate\": \"46.9%\"}",
"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.",