-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.java
65 lines (63 loc) · 1.38 KB
/
Solution.java
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
package monotonicarray;
/**
* 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
*/
class Solution {
/**
* Runtime: 2 ms, faster than 51.44% of Java online submissions for Monotonic Array.
* Memory Usage: 66.2 MB, less than 6.07% of Java online submissions for Monotonic Array
*
* @param A
* @return
*/
boolean isMonotonic(int[] A) {
boolean increasing = true;
boolean decreasing = true;
for (int i = 0; i < A.length - 1; i++) {
if (A[i] > A[i + 1]) {
increasing = false;
break;
}
}
for (int i = 0; i < A.length - 1; i++) {
if (A[i] < A[i + 1]) {
decreasing = false;
break;
}
}
return increasing || decreasing;
}
}