coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 15:31:43 +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/next-greater-node-in-linked-list.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 2079,
"dislikes": 97,
"likes": 2117,
"dislikes": 96,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[2,1,5]\n[2,7,4,3,5]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"98.9K\", \"totalSubmission\": \"166K\", \"totalAcceptedRaw\": 98930, \"totalSubmissionRaw\": 165951, \"acRate\": \"59.6%\"}",
"stats": "{\"totalAccepted\": \"100.9K\", \"totalSubmission\": \"169.2K\", \"totalAcceptedRaw\": 100926, \"totalSubmissionRaw\": 169173, \"acRate\": \"59.7%\"}",
"hints": [
"We can use a stack that stores nodes in monotone decreasing order of value. When we see a node_j with a larger value, every node_i in the stack has next_larger(node_i) = node_j ."
],