# LWC 60：735. Asteroid Collision

## LWC 60：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

98 篇文章33 人订阅

0 条评论

## 相关文章

892

2867

701

1251

### 09（02）总结final,多态，抽象类，接口

(4)抽象类的练习 A:猫狗案例练习 B:老师案例练习 C:学生案例练习 D:员工案例练习 /* A: 猫狗案例 具体事物：猫，狗 共性：姓名，...

4026

2716

1404

992

3236

1234