Leetcode - Asteroid Collision Solution
Poor Man
- Published
- Updated
- Reading time
- 2 min read
- Length
- 267 words
We are given an array asteroids of integers representing asteroids in a row.
For each asteroid, the absolute value represents its size, and the sign represents its direction (positive meaning right, negative meaning left). Each asteroid moves at the same speed.
Find out the state of the asteroids after all collisions. If two asteroids meet, the smaller one will explode. If both are the same size, both will explode. Two asteroids moving in the same direction will never meet.
Example 1:
Text
Input: asteroids = [5,10,-5]
Output: [5,10]
Explanation: The 10 and -5 collide resulting in 10. The 5 and 10 never collide.Example 2:
Text
Input: asteroids = [8,-8]
Output: []
Explanation: The 8 and -8 collide exploding each other.Example 3:
Text
Input: asteroids = [10,2,-5]
Output: [10]
Explanation: The 2 and -5 collide resulting in -5. The 10 and -5 collide resulting in 10.Example 4:
Text
Input: asteroids = [-2,-1,1,2]
Output: [-2,-1,1,2]
Explanation: The -2 and -1 are moving left, while the 1 and 2 are moving right. Asteroids moving the same direction never meet, so no asteroids will meet each other.Constraints:
2 <= asteroids.length <= 104-1000 <= asteroids[i] <= 1000asteroids[i] != 0
Solution in Python#
Python
class Solution:
def asteroidCollision(self, asteroids: List[int]) -> List[int]:
stack = []
for i in asteroids:
passed = False
while not passed:
if not stack:
stack.append(i)
passed = True
elif stack[-1] > 0 and i < 0:
if stack[-1] == abs(i):
stack.pop()
passed = True
elif stack[-1] > abs(i):
passed = True
continue
else:
stack.pop()
else:
stack.append(i)
passed = True
return stack