-
Notifications
You must be signed in to change notification settings - Fork 0
/
m1019.py
29 lines (26 loc) · 812 Bytes
/
m1019.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
# 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]:
curr = head
output = []
size = 0
while curr :
output.append(curr.val)
curr = curr.next
size += 1
largest = []
for i in range(size - 1, -1, -1) :
while largest and largest[-1] <= output[i] :
largest.pop()
if largest :
largest.append(output[i])
output[i] = largest[-2]
else :
largest.append(output[i])
output[i] = 0
continue
return output