LeetCode75——Day25

本文主要是介绍LeetCode75——Day25，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

一、题目

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.

Constraints:

2 <= asteroids.length <= 104
-1000 <= asteroids[i] <= 1000
asteroids[i] != 0

二、题解

利用vector模拟栈，无需使用stack

class Solution {
public:vector<int> asteroidCollision(vector<int>& asteroids) {int n = asteroids.size();vector<int> st;for(int i = 0;i < n;i++){if(st.empty()) st.push_back(asteroids[i]);else{if(st.back() > 0 && asteroids[i] < 0){int sub = abs(asteroids[i]) - abs(st.back());if(sub == 0) st.pop_back();else if(sub > 0){while(!st.empty() && st.back() > 0 && (abs(asteroids[i]) - abs(st.back()) > 0)) st.pop_back();if(st.empty()) st.push_back(asteroids[i]);else if((0 == abs(asteroids[i]) - abs(st.back())) && st.back() > 0) st.pop_back();else if(st.back() < 0) st.push_back(asteroids[i]);}}else st.push_back(asteroids[i]);}}return st;}
};

这篇关于LeetCode75——Day25的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---