735. Asteroid Collision

[zwfang]

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.

Note:
The length of asteroids will be at most 10000.
Each asteroid will be a non-zero integer in the range [-1000, 1000]..

[codecov]

Codecov Report

Merging #67 into master will increase coverage by 0.01%.
The diff coverage is 100%.

@@            Coverage Diff             @@
##           master      #67      +/-   ##
==========================================
+ Coverage    99.3%   99.31%   +0.01%     
==========================================
  Files         108      109       +1     
  Lines        1850     1865      +15     
==========================================
+ Hits         1837     1852      +15     
  Misses          9        9              
  Partials        4        4

Impacted Files	Coverage Δ
src/0735_asteroid_collision/ac.go	100% <100%> (ø)