zoukankan      html  css  js  c++  java
  • 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.
    

    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.
    

    Constraints:

    • 1 <= asteroids <= 104
    • -1000 <= asteroids[i] <= 1000
    • asteroids[i] != 0
    class Solution {
        public int[] asteroidCollision(int[] asteroids) {
                Stack<Integer> s = new Stack<>();
                for(int i: asteroids){
                    if(i > 0){
                        s.push(i);
                    }else{// i is negative
                        while(!s.isEmpty() && s.peek() > 0 && s.peek() < Math.abs(i)){
                            s.pop();
                        }
                        if(s.isEmpty() || s.peek() < 0){
                            s.push(i);
                        }else if(i + s.peek() == 0){
                            s.pop(); //equal
                        }
                    }
                }
                int[] res = new int[s.size()];   
                for(int i = res.length - 1; i >= 0; i--){
                    res[i] = s.pop();
                }
                return res;
            }
    }

    遇到有碰撞(?)的问题,可以考虑用stack,因为stack的peek能和新来的元素比较。

  • 相关阅读:
    c++类的大小
    c++面向对象的程序设计
    c++拷贝控制
    vsftpd出现“Response: 500 OOPS: cannot change directory”解决方法(转载)
    CentOS 安装 MRTG 软件完成后的 403 Forbidden(转载)
    Linux服务器 /var/spool/clientmqueue 目录下产生大量文件的删除办法
    mysql修改端口经验
    yum install mysql(转载)
    yum install tomcat
    yun install java
  • 原文地址:https://www.cnblogs.com/wentiliangkaihua/p/13855821.html
Copyright © 2011-2022 走看看