-
Notifications
You must be signed in to change notification settings - Fork 0
/
slice_divisible_problem.go
74 lines (63 loc) · 1.53 KB
/
slice_divisible_problem.go
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
package main
import (
"fmt"
"sort"
)
func main() {
// output = [5, 2, 1, 3, 7, 9, 12, 9, 11, 12, 3, 1]
input := []int{5, 2, 7, 3, 1, 9, 12, 11, 9, 12, 3, 1}
n := 2
res := make([]int, 0)
startIndex := 0
divisiableIndex := 0
inputLen := len(input)
// keep appending in to the res
for index, val := range input {
if val%n == 0 {
// get the slice of elements between this index
// and sort this values
divisiableIndex = index
innerSlice := input[startIndex:divisiableIndex]
innerSlice = sortInnerSlice(innerSlice)
for _, v := range innerSlice {
res = append(res, v)
}
// append the current index
res = append(res, val)
// set start index
startIndex = index + 1
}
}
// if reach last, just append the last values to res
if divisiableIndex != inputLen-1 {
for _, v := range input[startIndex:] {
res = append(res, v)
}
}
fmt.Println("Res: > ", res)
}
func sortInnerSlice(innerSlice []int) []int {
sort.Ints(innerSlice)
return innerSlice
}
func simpleSoln() {
// output = [5, 2, 1, 3, 7, 9, 12, 9, 11, 12, 1, 3, 10]
input := []int{5, 2, 7, 3, 1, 9, 12, 11, 9, 12, 3, 1, 10}
n := 2
startIndex := 0
divisiableIndex := 0
// inputLen := len(input)
// keep appending in to the res
for index, val := range input {
if val%n == 0 {
// get the slice of elements between this index
// and sort this values
divisiableIndex = index
innerSlice := input[startIndex:divisiableIndex]
sort.Ints(innerSlice)
// set start index
startIndex = index + 1
}
}
fmt.Println("Res: > ", input)
}