LeetCode 735. Asteroid Collision

原题链接在这里：https://leetcode.com/problems/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]..

题解：

Have a queue, when it is positive number ,add to the back.

When it is negative, poll from the last if last number is positive but smaller than -num.

If queue is empty or last number is negative, then add num. 

Else if last number == -num, poll it out.

The nums in queue is the result.

Time Complexity: O(n). n = asteroids.length.

Space: O(n).

AC Java:

class Solution {
    public int[] asteroidCollision(int[] asteroids) {
        if(asteroids == null || asteroids.length == 0){
            return asteroids;
        }
        
        LinkedList<Integer> que = new LinkedList<>();
        for(int num : asteroids){
            if(num > 0){
                que.add(num);
            }else if(num < 0){
                while(!que.isEmpty() && que.peekLast() > 0 && que.peekLast() < -num){
                    que.pollLast();
                }
                
                if(que.isEmpty() || que.peekLast() < 0){
                    que.add(num);
                }else if(que.peekLast() == -num){
                    que.pollLast();
                }
            }
        }
        
        int [] arr = new int[que.size()];
        for(int i = 0; i < arr.length; i++){
            arr[i] = que.pollFirst();
        }
        
        return arr;
    }
}