-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathminimum-impossible-or.go
More file actions
53 lines (46 loc) · 873 Bytes
/
Copy pathminimum-impossible-or.go
File metadata and controls
53 lines (46 loc) · 873 Bytes
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
package main
import (
"fmt"
)
// source: https://leetcode.com/problems/minimum-impossible-or/
func minImpossibleOR(nums []int) int {
m := make(map[int]bool)
ans := 1
for _, i := range nums {
m[i] = true
}
for m[ans] {
ans *= 2
}
return ans
}
func main() {
testCases := []struct {
nums []int
want int
}{
{
nums: []int{2, 1},
want: 4,
},
{
nums: []int{5, 3, 2},
want: 1,
},
}
successes := 0
for _, tc := range testCases {
x := minImpossibleOR(tc.nums)
status := "ERROR"
if fmt.Sprint(x) == fmt.Sprint(tc.want) {
status = "OK"
successes++
}
fmt.Println(status, " Expected: ", tc.want, " Actual: ", x)
}
if l := len(testCases); successes == len(testCases) {
fmt.Printf("===\nSUCCESS: %d of %d tests ended successfully\n", successes, l)
} else {
fmt.Printf("===\nFAIL: %d tests failed\n", l-successes)
}
}