forked from mohitjain/leetcode_solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path735_asteroid_collision.rb
More file actions
81 lines (78 loc) · 2.29 KB
/
735_asteroid_collision.rb
File metadata and controls
81 lines (78 loc) · 2.29 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
#Leetcode Problem: 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.
#
# 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]..
# ----------------------------------------------------------------------------------------------------------------------
# @param {Integer[]} asteroids
# @return {Integer[]}
require_relative 'core/stack'
def asteroid_collision(asteroids)
stack = Stack.new
asteroids.each do |asteroid|
destroy = false
if asteroid.positive?
stack.push asteroid
next
else
while !stack.empty? && stack.top.positive?
top_element = stack.top
if top_element < asteroid.abs
stack.pop
elsif top_element == asteroid.abs
destroy = true
stack.pop
break
elsif top_element > asteroid.abs
break
end
end
if (stack.empty? || stack.top.negative?) && !destroy
stack.push asteroid
end
end
end
stack.to_array
end
p asteroid_collision [5, 10, -5]
p asteroid_collision [8, -8]
p asteroid_collision [10, 2, -5]
p asteroid_collision [-2,-1, 1, 2]