题目链接:735. 行星碰撞
模拟。
from typing import List
class Solution:
def asteroidCollision(self, asteroids: List[int]) -> List[int]:
while True:
for i in range(1, len(asteroids)):
if asteroids[i - 1] > 0 > asteroids[i]:
if asteroids[i - 1] + asteroids[i] == 0:
asteroids.pop(i)
asteroids.pop(i - 1)
elif asteroids[i - 1] + asteroids[i] < 0:
asteroids.pop(i - 1)
elif asteroids[i - 1] + asteroids[i] > 0:
asteroids.pop(i)
break
else:
return asteroids