-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcheck-if-array-is-sorted-and-rotated.go
More file actions
62 lines (56 loc) · 1.06 KB
/
check-if-array-is-sorted-and-rotated.go
File metadata and controls
62 lines (56 loc) · 1.06 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
package main
import (
"fmt"
"sort"
)
// source: https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/
func check(nums []int) bool {
n := len(nums)
i := 1
for i < n && nums[i-1] <= nums[i] {
i++
}
sorted := sort.IntsAreSorted(nums[:i]) && sort.IntsAreSorted(nums[i:])
if i < n {
return sorted && (nums[0] >= nums[n-1])
}
return sorted
}
func main() {
testCases := []struct {
nums []int
want bool
}{
{
nums: []int{1, 1, 1},
want: true,
},
{
nums: []int{3, 4, 5, 1, 2},
want: true,
},
{
nums: []int{2, 1, 3, 4},
want: false,
},
{
nums: []int{1, 2, 3},
want: true,
},
}
successes := 0
for _, tc := range testCases {
x := check(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)
}
}