LWC 60:735. Asteroid Collision
来源:互联网 发布:手机淘宝 无响应 编辑:程序博客网 时间:2024/06/05 10:59
LWC 60:735. Asteroid Collision
传送门:735. Asteroid Collision
Problem:
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].
思路:
问题的归简,相碰的行星一定是→←这个方向,所以当遇到前后两行星属于这种方向时,则缩小规模,如果质量相等则都消失,否则质量较小的消失。采用栈的形式始终维持新鲜的最右位置和加入的行星比较即可。
Java版:
List{Integer} 转 int[] : list.stream().mapToInt(i -> i).toArray();
public int[] asteroidCollision(int[] asteroids) { int n = asteroids.length; Stack<Integer> stack = new Stack<>(); for (int i = 0; i < n; ++i) { if (stack.isEmpty()) { stack.push(asteroids[i]); continue; } int prev = stack.peek(); boolean pf = prev >= 0; int curr = asteroids[i]; boolean cf = curr >= 0; if (pf == true && cf == false) { if (Math.abs(prev) > Math.abs(curr)) { } else if (Math.abs(prev) < Math.abs(curr)) { stack.pop(); i = i - 1; } else { stack.pop(); } } else { stack.push(curr); } } return stack.stream().mapToInt(i -> i).toArray(); }
Python 版本:
def asteroidCollision(self, asteroids): """ :type asteroids: List[int] :rtype: List[int] """ stack = [] i = 0 n = len(asteroids) while i < n: if stack == []: stack.append(asteroids[i]) i = i + 1 continue prev = stack[-1] curr = asteroids[i] if prev >= 0 and curr < 0: if abs(prev) > abs(curr): pass elif abs(prev) < abs(curr): stack.pop() i = i - 1 else: stack.pop() else: stack.append(curr) i = i + 1 return stack
- LWC 60:735. Asteroid Collision
- 735. Asteroid Collision
- Asteroid Collision
- Leetcode_735 Asteroid Collision
- Asteroid Collision问题及解法
- leetcode 735[medium]---Asteroid Collision
- LeetCode 735 Asteroid Collision (栈)
- LeetCode刷题 | 735. Asteroid Collision12_16
- LWC 60:733. Flood Fill
- LWC 60:734. Sentence Similarity
- Collision
- LWC 60:736. Parse Lisp Expression
- 1279 - Asteroid Rangers
- LA 6026 Asteroid Rangers
- asteroid 2005 YU55
- Collision filtering
- Collision strength
- UVALive4922_Queen Collision
- SDUT-3404
- 有关 Android 应用桌面角标 (BadgeNumber) 实现的探讨
- 数据库 表中主键字符串通过函数取值
- SharePoint 2013 DateTime字段查询
- cocos2d项目如何关掉多点触摸
- LWC 60:735. Asteroid Collision
- 远程调试DEBUG YII框架
- JS正则验证(常用)
- 分水岭算法及案例
- 使用maven 下载jars,并指定settings.xml
- android高德地图自定义infoWindow、点击其它地方隐藏infoWindow、infoWindow点击事件
- Elasticsearch异常之Validation Failed:1 : text is missing。
- JAVA作业1
- JavaScript常见算法面试题