-
Notifications
You must be signed in to change notification settings - Fork 0
/
arrayMountain.java
52 lines (38 loc) · 947 Bytes
/
arrayMountain.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
Given an array A of integers, return true if and only if it is a valid mountain array.
Recall that A is a mountain array if and only if:
A.length >= 3
There exists some i with 0 < i < A.length - 1 such that:
A[0] < A[1] < ... A[i-1] < A[i]
A[i] > A[i+1] > ... > A[A.length - 1]
Example 1:
Input: [2,1]
Output: false
Example 2:
Input: [3,5,5]
Output: false
Example 3:
Input: [0,3,2,1]
Output: true
class Solution {
public boolean validMountainArray(int[] A) {
int len = A.length -1;
int i = 0;
while(i < len){
if(A[i] < A[i+1]){
i++;
} else {
break;
}
}
if(i == 0 || i == len){
return false;
}
while(i < len){
if(A[i] > A[i+1]){
i++;
} else {
break;
}
}
return i == len;}
}