21.03.03 - [BOJ] 10773. 제로

[suhyunsim]

문제

• 10773

핵심 아이디어

• 0 기준 스택 pop push

어려운 점, 실수

풀이

package main.java.com.poogle.BOJ.Q10773;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Stack;

public class Main {
    public static void main(String[] args) throws NumberFormatException, IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int i, t, sum = 0; /* input */
        int N = Integer.parseInt(br.readLine());
        Stack<Integer> stack = new Stack<Integer>(); /* stack */
        for (i = 0; i < N; i++) {
            t = Integer.parseInt(br.readLine());
            if (t == 0 && !stack.isEmpty()) {
                stack.pop();
            } else if (t != 0) {
                stack.push(t);
            }
        } /* sum */
        while (!stack.isEmpty()) {
            sum += stack.pop();
        }
        System.out.println(sum);
    }
}