Last active
September 14, 2021 02:27
-
-
Save ssshukla26/4f8855ea20e7aee7848a8416877444a0 to your computer and use it in GitHub Desktop.
Monotonic Stacks
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
nums = [1,4,3,2,2,1,9] | |
m = len(nums) | |
# Next Smallest | |
next_smallest = [-1] * m | |
stack = [] | |
for i in range(m): | |
if stack: | |
while stack and stack[-1][1] > nums[i]: | |
idx, num = stack.pop() | |
next_smallest[idx] = nums[i] | |
stack.append((i,nums[i])) | |
# Next Largest | |
next_largest = [-1] * m | |
stack = [] | |
for i in range(m): | |
if stack: | |
while stack and stack[-1][1] < nums[i]: | |
idx, num = stack.pop() | |
next_largest[idx] = nums[i] | |
stack.append((i,nums[i])) | |
# Next Smaller | |
next_smaller = [-1] * m | |
stack = [] | |
for i in range(m): | |
if stack: | |
while stack and stack[-1][1] > nums[i]: | |
idx, num = stack.pop() | |
next_smaller[idx] = nums[i] | |
break | |
stack.append((i,nums[i])) | |
# Next Larger | |
next_larger = [-1] * m | |
stack = [] | |
for i in range(m): | |
if stack: | |
while stack and stack[-1][1] < nums[i]: | |
idx, num = stack.pop() | |
next_larger[idx] = nums[i] | |
break | |
stack.append((i,nums[i])) | |
print("Original: \t\t{}".format(nums)) | |
print("Next Smallest: \t{}".format(next_smallest)) | |
print("Next Largest: \t{}".format(next_largest)) | |
print("Next Smaller: \t{}".format(next_smaller)) | |
print("Next Larger: \t{}".format(next_larger)) | |
""" | |
Original: [1, 4, 3, 2, 2, 1, 9] | |
Next Smallest: [-1, 3, 2, 1, 1, -1, -1] | |
Next Largest: [4, 9, 9, 9, 9, 9, -1] | |
Next Smaller: [-1, 3, 2, -1, 1, -1, -1] | |
Next Larger: [4, -1, -1, -1, -1, 9, -1] | |
""" |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment