zoukankan      html  css  js  c++  java
  • 735. Asteroid Collision

    package LeetCode_735
    
    import java.util.*
    
    /**
     * 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.
    
    Constraints:
    1. 1 <= asteroids <= 104
    2. -1000 <= asteroids[i] <= 1000
    3. asteroids[i] != 0
     * */
    class Solution {
        /*
        * solution: Stack, Time:O(n), Space:O(n)
        * 1. for position one, push into stack
        * 2. for negative one:
        *   if empty or top of stack is negative, push into stack; if top of stack < abs(negative), pop it from stack, then push negative
        * */
        fun asteroidCollision(asteroids: IntArray): IntArray {
            if (asteroids == null || asteroids.isEmpty()) {
                return intArrayOf()
            }
            val stack = Stack<Int>()
            for (item in asteroids) {
                if (item > 0) {
                    //to right
                    stack.push(item)
                } else {
                    //to left
                    //if stack notEmpty and peek>0 (because peek<0 would be push) and peek < abs(negative)
                    while (stack.isNotEmpty() && stack.peek() > 0 && stack.peek() < Math.abs(item)) {
                        stack.pop()
                    }
                    if (stack.isEmpty() || stack.peek() < 0) {
                        stack.push(item)
                    } else if (stack.peek() == Math.abs(item)) {
                        stack.pop()
                    }
                }
            }
            return stack.toIntArray()
        }
    }
  • 相关阅读:
    VBS处理AD帐号密码到期提醒的脚本[zt]
    简单几步手工扩容LVM、缩小LVM及移除磁盘(笔记)
    python加入进度条:tqdm 和 progressbar
    python的map和reduce函数
    python的lambda表达式
    python的推导式 —— 列表推导式、集合和字典推导式
    Pyspark中遇到的 java.io.IOException: Not a file 和 pyspark.sql.utils.AnalysisException: 'Table or view not found
    pyecharts绘制map地图
    pyecharts绘制geo地图
    sklearn.feature_extraction.text 的TfidfVectorizer函数
  • 原文地址:https://www.cnblogs.com/johnnyzhao/p/14043907.html
Copyright © 2011-2022 走看看