forked from YuriSpiridonov/LeetCode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
735.AsteroidCollision.py
65 lines (58 loc) · 2.21 KB
/
735.AsteroidCollision.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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
"""
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:
Input: asteroids = [5,10,-5]
Output: [5,10]
Explanation: The 10 and -5 collide resulting in 10. The 5 and 10 never
collide.
Example:
Input: asteroids = [8,-8]
Output: []
Explanation: The 8 and -8 collide exploding each other.
Example:
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:
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:
- 1 <= asteroids <= 10**4
- -1000 <= asteroids[i] <= 1000
- asteroids[i] != 0
"""
#Difficulty: Medium
#275 / 275 test cases passed.
#Runtime: 84 ms
#Memory Usage: 15.1 MB
#Runtime: 84 ms, faster than 98.87% of Python3 online submissions for Asteroid Collision.
#Memory Usage: 15.1 MB, less than 99.31% of Python3 online submissions for Asteroid Collision.
class Solution:
def asteroidCollision(self, asteroids: List[int]) -> List[int]:
stack = []
result = []
for asteroid in asteroids:
if asteroid > 0:
stack.append(asteroid)
else:
while stack and stack[-1] < abs(asteroid):
stack.pop()
if stack and stack[-1] == abs(asteroid):
stack.pop()
continue
if not stack:
result.append(asteroid)
if stack:
result.extend(stack)
return result