LeetCode-Solutions/Python/asteroid-collision.py at master · pythonpeixun/LeetCode-Solutions · GitHub

23 lines (20 loc) · 581 Bytes

# Time: O(n)

# Space: O(n)

class Solution(object):

def asteroidCollision(self, asteroids):

"""

:type asteroids: List[int]

:rtype: List[int]

"""

result = []

for asteroid in asteroids:

while result and asteroid < 0 < result[-1]:

if result[-1] < -asteroid:

result.pop()

continue

elif result[-1] == -asteroid:

result.pop()

break

else:

result.append(asteroid)

return result

Expand file tree