2023-07-20 Daily Challenge
Today I have done leetcode's July LeetCoding Challenge with cpp
.
July LeetCoding Challenge 20
Description
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.
Constraints:
2 <= asteroids.length <= 104
-1000 <= asteroids[i] <= 1000
asteroids[i] != 0
Solution
auto speedup = [](){
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
return 0;
}();
class Solution {
public:
vector<int> asteroidCollision(vector<int>& asteroids) {
vector<int> s;
s.push_back(asteroids[0]);
for(int i = 1; i < asteroids.size(); ++i) {
if(s.empty() || s.back() < 0) {
s.push_back(asteroids[i]);
continue;
}
if(asteroids[i] > 0) {
s.push_back(asteroids[i]);
continue;
}
while(s.size() && s.back() > 0 && -asteroids[i] > s.back()) s.pop_back();
if(s.empty() || s.back() < 0) s.push_back(asteroids[i]);
else if(s.size() && -asteroids[i] == s.back()) s.pop_back();
}
return s;
}
};
// Accepted
// 275/275 cases passed (15 ms)
// Your runtime beats 71.71 % of cpp submissions
// Your memory usage beats 81.53 % of cpp submissions (17.5 MB)