Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- # Definition for singly-linked list.
- # class ListNode:
- # def __init__(self, x):
- # self.val = x
- # self.next = None
- class Solution:
- def nextLargerNodes(self, head: ListNode) -> List[int]:
- vals = []
- val = head
- while val != None:
- vals.append(val.val)
- val = val.next
- stack = []
- larger = []
- for i in range(len(vals)-1, -1, -1):
- # print(stack)
- while stack and vals[i] >= stack[-1]:
- stack = stack[:-1]
- if not stack:
- larger.append(0)
- else:
- larger.append(stack[-1])
- stack.append(vals[i])
- larger.reverse()
- return larger
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement