leetcode: finished #1019

content/leetcode/2023/12.md

@@ -3,6 +3,38 @@ title: 2023.12
 draft: false
 ---
 
+# 2023.12.28
+
+```python
+#
+# @lc app=leetcode.cn id=1019 lang=python3
+#
+# [1019] 链表中的下一个更大节点
+#
+
+
+# @lc code=start
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def nextLargerNodes(self, head: Optional[ListNode]) -> List[int]:
+        stack = []
+        res = []
+        while head:
+            while stack and stack[-1][1] < head.val:
+                res[stack.pop()[0]] = head.val
+            stack.append((len(res), head.val))
+            res.append(0)
+            head = head.next
+        return res
+
+
+# @lc code=end
+```
+
 # 2023.12.27
 
 ```python