[코딜리티] - Lesson 7.StoneWall

안녕하세요 남갯입니다.

public static int solution(int[] H) {
    // write your code in Java SE 8
    int result = 0;
    Stack<Integer> stack = new Stack<>();
    stack.push(H[0]);
    result ++;
    for (int i = 0; i < H.length; i++) {
        if (H[i] > stack.peek()) {
            stack.push(H[i]);
            result++;
        } else if (H[i] < stack.peek()) {
            while (!stack.empty() && H[i] < stack.peek()) {
                stack.pop();
            }
            if(!stack.empty() && stack.peek() == H[i]){

            }else{
                result++;
            }
            stack.push(H[i]);
        }
    }

    return result;
}

https://app.codility.com/demo/results/trainingCT2CYU-NAM/