-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path735-AsteroidCollision.go
More file actions
124 lines (110 loc) · 3.69 KB
/
735-AsteroidCollision.go
File metadata and controls
124 lines (110 loc) · 3.69 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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
package main
// 735. 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.
// Constraints:
// 2 <= asteroids.length <= 10^4
// -1000 <= asteroids[i] <= 1000
// asteroids[i] != 0
import "fmt"
// stack
func asteroidCollision(asteroids []int) []int {
res := []int{}
for _, v := range asteroids {
for len(res) != 0 && res[len(res)-1] > 0 && res[len(res)-1] < -v {
res = res[:len(res)-1]
}
if len(res) == 0 || v > 0 || res[len(res)-1] < 0 {
res = append(res, v)
} else if v < 0 && res[len(res)-1] == -v {
res = res[:len(res)-1]
}
}
return res
}
func asteroidCollision1(asteroids []int) []int {
result, i, a := make([]int, 0), 0, 0
for i < len(asteroids) {
a = asteroids[i]
if len(result) == 0 || a > 0 || result[len(result)-1] < 0 {
result = append(result, a)
i++
continue
}
if result[len(result)-1] > a * -1 {
i++
continue
}
if result[len(result)-1] == a * -1 {
result = result[:len(result)-1]
i++
continue
}
result = result[:len(result)-1]
}
return result
}
func asteroidCollision2(asteroids []int) []int {
stack := []int{}
for _, v := range asteroids {
if len(stack) == 0 || v > 0{
stack = append(stack, v)
continue
}
for {
if len(stack) == 0 || stack[len(stack)-1] < 0 {
stack = append(stack, v)
break
}
if stack[len(stack)-1] == -v {
stack = stack[:len(stack)-1]
break
}
if stack[len(stack)-1] > -v {
break
}
stack = stack[:len(stack)-1]
}
}
return stack
}
func main() {
// 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.
fmt.Println(asteroidCollision([]int{5,10,-5})) // [5,10]
// Example 2:
// Input: asteroids = [8,-8]
// Output: []
// Explanation: The 8 and -8 collide exploding each other.
fmt.Println(asteroidCollision([]int{8,-8})) // []
// 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.
fmt.Println(asteroidCollision([]int{10,2,-5})) // [10]
fmt.Println(asteroidCollision1([]int{5,10,-5})) // [5,10]
fmt.Println(asteroidCollision1([]int{8,-8})) // []
fmt.Println(asteroidCollision1([]int{10,2,-5})) // [10]
fmt.Println(asteroidCollision2([]int{5,10,-5})) // [5,10]
fmt.Println(asteroidCollision2([]int{8,-8})) // []
fmt.Println(asteroidCollision2([]int{10,2,-5})) // [10]
}