使用栈的思想,仔细看题目,其实就是栈的入栈和出栈的过程。需要注意的是,如果一开始是反方向的话,可以直接入栈的
import java.util.Arrays;
import java.util.Deque;
import java.util.LinkedList;
/**
* @author xnl
* @Description:
* @date: 2022/7/13 21:37
*/
public class Solution {
public static void main(String[] args) {
Solution solution = new Solution();
int[] arr= {10,2, -50};
System.out.println(Arrays.toString(solution.asteroidCollision(arr)));
}
public int[] asteroidCollision(int[] asteroids) {
Deque<Integer> deque = new LinkedList<>();
for (int asteroid : asteroids) {
boolean alive = true;
// 会产生碰撞的情况: 栈顶的元素大于0 ,并且当前元素往方向走
while (alive && asteroid < 0 && !deque.isEmpty() && deque.peek() > 0){
alive = deque.peek() < -asteroid;// 行星反方向的速度大于正方向的速度
if(deque.peek() <= -asteroid){
deque.pop();// 行星爆炸
}
}
if (alive){
deque.push(asteroid);
}
}
int[] res = new int[deque.size()];
int i = deque.size() - 1;
while (!deque.isEmpty()){
res[i--] = deque.pop();
}
return res;
}
}