其他分享
首页 > 其他分享> > LeetCode 735 - Asteroid Collision

LeetCode 735 - Asteroid Collision

作者：互联网

LeetCode 735 - 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

Example 1:

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

Example 2:

Input: asteroids = [8,-8]
Output: []
Explanation: The 8 and -8 collide exploding each other.

Example 3:

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 4:

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

思路分析

分析题目可知，使行星发生碰撞的条件只有一种：前一个行星与后一个行星相向而行，即\(asteroids[x]>0,asteroids[x+1]<0\).
当行星发生碰撞后，需要继续判断是否发生第二次碰撞，显然，我们可以使用栈解决这个问题。

graph TD begin("begin") --> for{"ergodic asteroids"} for --> if_isStackEmpty{"stack.empty()?"} if_isStackEmpty --> |"true"| stack_push1["stack.push_back(asteroids[i])"] --> for if_isStackEmpty --> if_isCollision{"collision?"} if_isCollision --> |"true"| while{"!stack.empty() and collision?"} while --> if_big{"asteroids[i] is small?"} if_big --> |"true"| type((" ")) -->|"do not push"| if_isPush if_big --> |"false"| if_small{"asteroids[i] is big?"} if_small --> |"true"| stack_pop1["stack.pop_back()"] --> |"push"| while if_small --> |"false"| if_equal{"equal?"} if_equal --> |"true"| stack_pop2["stack.pop_back()"] --> |"do not push"| if_isPush while --> |"end"| if_isPush if_isPush{"push asteroids[i]?"} if_isPush --> |"true"| stack_push3["stack.push_back(asteroids[i])"] --> for if_isCollision --> |"false"| stack_push2["stack.push_back(asteroids[i])"] --> for for --> |"end"| return["return stack"] --> End("end") text["Note: collision is stack.back() > 0 and asteroids[i] < 0"]

代码实现

// C++
class Solution {
public:
    vector<int> asteroidCollision(vector<int>& asteroids) {
        vector<int> stack;
        for (int i = 0; i < asteroids.size(); i++) {
            if (stack.empty() == true) {
                stack.push_back(asteroids[i]);
                continue;
            }
            if (stack.back() > 0 && asteroids[i] < 0) {
                bool isPush = false;
                while (stack.empty() == false && stack.back() > 0 && asteroids[i] < 0) {
                    if (abs(stack.back()) > abs(asteroids[i])) {
                        isPush = false;
                        break;
                    }
                    else if (abs(stack.back()) < abs(asteroids[i])) {
                        stack.pop_back();
                        isPush = true;
                        // stack.push_back(asteroids[i]);
                    }
                    else if (abs(stack.back()) == abs(asteroids[i])) {
                        stack.pop_back();
                        isPush = false;
                        break;
                    }
                }
                if (isPush == true) {
                    stack.push_back(asteroids[i]);
                }
            }
            else {
                stack.push_back(asteroids[i]);
            }
        }
        return stack;
    }
};

标签：--,asteroids,back,Collision,isPush,Asteroid,735,push,stack
来源： https://www.cnblogs.com/ikaroinory/p/14741940.html