Lintcode 1001. Asteroid Collision (Medium) (Python)

最新推荐文章于 2024-08-13 08:35:09 发布

2Young2Simple

最新推荐文章于 2024-08-13 08:35:09 发布

阅读量319

点赞数

分类专栏： Lintcode刷题文章标签： Lintcode Python

本文链接：https://blog.csdn.net/weixin_41677877/article/details/82655771

版权

Lintcode刷题专栏收录该内容

82 篇文章 0 订阅

订阅专栏

Asteroid Collision

Description:

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.

Input:
asteroids = [10, 2, -5]
Output: [10]
Explanation:
The 2 and -5 collide resulting in -5. The 10 and -5 collide resulting in 10.

Notice
The length of asteroids will be at most 10000.
Each asteroid will be a non-zero integer in the range [-1000, 1000]..

Code:

class Solution:
    """
    @param asteroids: a list of integers
    @return: return a list of integers
    """
    def asteroidCollision(self, asteroids):
        # write your code here
        stack = []
        for i in asteroids:
            while i<0 and stack and stack[-1]>=0:
                last = stack.pop()
                if last==-i:
                    i = None
                    break
                elif last>-i:
                    i = last
            if i:
                stack.append(i)
        return stack