diff options
author | Jack Sangdahl <[email protected]> | 2025-08-25 13:07:56 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-08-25 13:07:56 -0600 |
commit | f0a4209eaec07cd0eb8bb7ff15be34f8adb1437c (patch) | |
tree | 1738e3726b6198e485f10fb26cd8468008915cb8 /next_greater_node_link_list.py | |
parent | 3f521a9849997608712e92ad8e90e83ff1cefdc0 (diff) | |
download | leetcode-f0a4209eaec07cd0eb8bb7ff15be34f8adb1437c.tar.gz leetcode-f0a4209eaec07cd0eb8bb7ff15be34f8adb1437c.zip |
1019. next greater node in linked list
Diffstat (limited to 'next_greater_node_link_list.py')
-rw-r--r-- | next_greater_node_link_list.py | 35 |
1 files changed, 35 insertions, 0 deletions
diff --git a/next_greater_node_link_list.py b/next_greater_node_link_list.py new file mode 100644 index 0000000..70d9d79 --- /dev/null +++ b/next_greater_node_link_list.py @@ -0,0 +1,35 @@ +# 1019. Next Greater Node In Linked List +from leetcode import listnode_build + +""" +you are given the 'head' of a linked list with 'n' nodes. for each node in +the list, find the value of the next greater node. that is, for eachnode, +find the value of the first node that is next to it and has a stricty larger +value than it. return an integer array 'answer' where 'answer[i]' is the +value of the next greter node of the i'th node (1-indexed). if the i'th node +does not have a next greater node, set 'ans[i] = 0'. +""" + + +class Solution(object): + def nextLargerNodes(self, head): + """ + :type head: Optional[ListNode] + :rtype: List[int] + """ + ans, stack = [], [] + while head: + while stack and stack[-1][1] < head.val: + ans[stack.pop()[0]] = head.val + stack.append([len(ans), head.val]) + ans.append(0) + head = head.next + return ans + + +if __name__ == "__main__": + obj = Solution() + h1 = listnode_build(vals=[2, 1, 5]) + h2 = listnode_build(vals=[2, 7, 4, 3, 5]) + print(obj.nextLargerNodes(h1)) + print(obj.nextLargerNodes(h2)) |