mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
40 lines
1.4 KiB
HTML
40 lines
1.4 KiB
HTML
<p>We are given an array <code>asteroids</code> of integers representing asteroids in a row.</p>
|
|
|
|
<p>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.</p>
|
|
|
|
<p>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.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> asteroids = [5,10,-5]
|
|
<strong>Output:</strong> [5,10]
|
|
<strong>Explanation:</strong> The 10 and -5 collide resulting in 10. The 5 and 10 never collide.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> asteroids = [8,-8]
|
|
<strong>Output:</strong> []
|
|
<strong>Explanation:</strong> The 8 and -8 collide exploding each other.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> asteroids = [10,2,-5]
|
|
<strong>Output:</strong> [10]
|
|
<strong>Explanation:</strong> The 2 and -5 collide resulting in -5. The 10 and -5 collide resulting in 10.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>2 <= asteroids.length <= 10<sup>4</sup></code></li>
|
|
<li><code>-1000 <= asteroids[i] <= 1000</code></li>
|
|
<li><code>asteroids[i] != 0</code></li>
|
|
</ul>
|