The Valid Mountain Array Problem using 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

class Solution {
    // Input array of integers
    public boolean validMountainArray(int[] A) {
        // if we have less than 3 integers, it will always be false
        if (A.length<3) return false;

        // set our counter variables
        int len = A.length;
        int i = 0;
        
        // walk up the array until it decreases
        while (i+1 < len && A[i]<A[i+1])
            // increment our counter
            i++;
        
        // if the start or end characters are the same as our counter
        // then the mountain didn't decrease
        if (i==0 || i==len-1)
            return false;
        
        // walk the array while it decreases
        // starting at the last counter index
        while (i+1 < len && A[i]>A[i+1])
            i++;
        
        // return a boolean if the counter is the same as the length
        return i == len-1;

    }
}