leetcode 735[medium]---Asteroid Collision
来源:互联网 发布:化纤衣服危害 知乎 编辑:程序博客网 时间:2024/06/13 22:06
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:
asteroids
will be at most 10000
.[-1000, 1000].
.思路:给定一个array,如果正数在前,负数在后,两者相碰取绝对值较大者,消掉另一个数。保留下来的数如果是负数,可以继续与其前面的正数相消。 如果两者绝对值相同,两个数都被消掉。如果负数在前,正数在后,消除反应不会进行。
借鉴别人的code,While循环找到每次调整以后的之后是负数的正数的索引。
for 循环比较正数与负数,用pop()删除消除的数。shrink 用来调整消除后i的位置。
膜拜这种简直是在用python写故事的大神。
- leetcode 735[medium]---Asteroid Collision
- LeetCode 735 Asteroid Collision (栈)
- Asteroid Collision
- 735. Asteroid Collision
- Leetcode_735 Asteroid Collision
- LWC 60:735. Asteroid Collision
- Asteroid Collision问题及解法
- LeetCode.735 Asteriod Collision
- LeetCode刷题 | 735. Asteroid Collision12_16
- Collision
- [Leetcode 49, medium] Anagrams
- [Leetcode 120, Medium] Triangle
- 【LeetCode】(120)Triangle (Medium)
- <LeetCode><Medium>15 ThreeNums
- 【leetcode】Two Sum(medium)
- LeetCode Medium集锦
- Leetcode medium (一)
- Array Leetcode :Medium
- 自学android教程视频
- 微信小程序 联动菜单 部门 岗位
- 不同loss函数在不同网络结构下的误差后传
- 可并堆
- 剑指offer — 把字符串转换成整数
- leetcode 735[medium]---Asteroid Collision
- SVG初体验
- ubuntu eclipse opencv的环境配置(2)
- 邮件发送里面的SMTP Host
- Data Structure
- opencv中的人脸检测
- C++中使用placement new
- http://blog.csdn.NET/liweizhong193516/article/details/53639350
- Win10 Jupyter Notebook修改home路径