coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/next-greater-node-in-linked-list.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 2075,
"likes": 2079,
"dislikes": 97,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"98.8K\", \"totalSubmission\": \"165.7K\", \"totalAcceptedRaw\": 98772, \"totalSubmissionRaw\": 165710, \"acRate\": \"59.6%\"}",
"stats": "{\"totalAccepted\": \"98.9K\", \"totalSubmission\": \"166K\", \"totalAcceptedRaw\": 98930, \"totalSubmissionRaw\": 165951, \"acRate\": \"59.6%\"}",
"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 ."
],