-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathisMonotonic.go
More file actions
66 lines (47 loc) · 1020 Bytes
/
Copy pathisMonotonic.go
File metadata and controls
66 lines (47 loc) · 1020 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
54
55
56
57
58
59
60
61
62
63
64
65
66
/* https://leetcode.com/problems/monotonic-array/
An array is monotonic if it is either monotone increasing or monotone decreasing.
An array A is monotone increasing if for all i <= j, A[i] <= A[j]. An array A is monotone decreasing if for all i <= j, A[i] >= A[j].
Return true if and only if the given array A is monotonic.
Example 1:
Input: [1,2,2,3]
Output: true
Example 2:
Input: [6,5,4,4]
Output: true
Example 3:
Input: [1,3,2]
Output: false
Example 4:
Input: [1,2,4,5]
Output: true
Example 5:
Input: [1,1,1]
Output: true
Note:
1 <= A.length <= 50000
-100000 <= A[i] <= 100000
*/
package larray
func isMonotonic(A []int) bool {
if len(A) == 1 {
return true
}
i, flag := 0, false
for i < len(A)-1 && A[i] == A[i+1] {
i++
}
i++
if i >= len(A) {
return true // tail
}
if A[i-1] < A[i] {
flag = true
}
for ; i < len(A); i++ {
if A[i-1] == A[i] || (A[i-1] < A[i] && flag == true) || (A[i-1] > A[i] && flag == false) {
continue
}
return false
}
return true
}