735. Asteroid Collision - LeetCode

class Solution:
    def asteroidCollision(self, asteroids: list[int]) -> list[int]:
        s: list[int] = []
        for a in asteroids:
            s.append(a)
            while len(s) > 1 and s[-2] > 0 > s[-1]:
                if s[-2] == -s[-1]:
                    s.pop()
                elif s[-2] < -s[-1]:
                    s[-2] = s[-1]
                s.pop()
        return s