[백준 알고리즘] 10773번 제로 (Python, Java)

 

<Python>

K = int(input())

list = []
for _ in range(K):
    n = int(input())
    if n == 0:
        if len(list)>0:
            list.pop()
    else:
        list.append(n)

print(sum(list))

 

<Java>

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 IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int k = Integer.parseInt(br.readLine());
        Stack<Integer> stack = new Stack<>();

        for(int i=0; i<k; i++){
            int num = Integer.parseInt(br.readLine());
            if(num==0)
                stack.pop();
            else
                stack.push(num);
        }
        
        int sum = 0;
        for(Integer i : stack)
            sum+=i;
        System.out.println(sum);
    }
}

▼ 링크

https://www.acmicpc.net/problem/10773

10773번: 제로