Problem:
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:
|
1 2 3 4 5 |
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:
|
1 2 3 4 5 |
Input: asteroids = [8, -8] Output: [] Explanation: The 8 and -8 collide exploding each other. |
Example 3:
|
1 2 3 4 5 |
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:
|
1 2 3 4 5 6 |
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
asteroidswill be at most10000. - Each asteroid will be a non-zero integer in the range
[-1000, 1000]..
Idea:
Simulation
Time complexity: O(n), Space complexity: O(n)
Solution:
C ++
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 |
// Author: Huahua // Runtime: 22 ms class Solution { public: vector<int> asteroidCollision(vector<int>& asteroids) { vector<int> s; for (int i = 0 ; i < asteroids.size(); ++i) { const int size = asteroids[i]; if (size > 0) { // To right, OK s.push_back(size); } else { // To left if (s.empty() || s.back() < 0) // OK when all are negtives s.push_back(size); else if (abs(s.back()) <= abs(size)) { // Top of the stack is going right. // Its size is less than the current one. // The current one still alive! if (abs(s.back()) < abs(size)) --i; s.pop_back(); // Destory the top one moving right } } } // s must look like [-s1, -s2, ... , si, sj, ...] return s; } }; |
请尊重作者的劳动成果，转载请注明出处！花花保留对文章／视频的所有权利。
如果您喜欢这篇文章／视频，欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
Paypal
Venmo
huahualeetcode
huahualeetcode
微信打赏
Be First to Comment