# 735. Asteroid Collision

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

``````Input:
asteroids = [5, 10, -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.
``````

Note:

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

``````class Solution {
public:
vector<int> asteroidCollision(vector<int>& asteroids) {
vector<int> res = asteroids;
while (true) {
if (res.size() <= 1) return res;
vector<int> t{res[0]};
for (int i = 1; i < res.size(); ++i) {
if (t.empty() || (res[i] > 0 && t.back() < 0) || res[i] * t.back() > 0) {
t.push_back(res[i]);
} else if (res[i] + t.back() == 0) {
t.pop_back();
} else if (res[i] < 0 && res[i] + t.back() < 0) {
t.back() = res[i];
}
}
if (t.size() == res.size()) break;
else res = t;
}
return res;
}
};
``````

``````class Solution {
public:
vector<int> asteroidCollision(vector<int>& asteroids) {
vector<int> res;
for (int i = 0; i < asteroids.size(); ++i) {
if (asteroids[i] > 0) {
res.push_back(asteroids[i]);
} else if (res.empty() || res.back() < 0) {
res.push_back(asteroids[i]);
} else if (res.back() <= -asteroids[i]) {
if (res.back() < -asteroids[i]) --i;
res.pop_back();
}
}
return res;
}
};
``````

Can Place Flowers

https://discuss.leetcode.com/topic/112034/java-c-clean-code

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation