SWExpert_1223_계산기2

문제링크

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14nnAaAFACFAYD&categoryId=AV14nnAaAFACFAYD&categoryType=CODE&problemTitle=1223&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1

SW Expert Academy

 

import java.util.Scanner;
import java.util.Stack;

public class Solution_1223 {

	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		Stack<Integer> stack = new Stack<>();
		StringBuilder sb = new StringBuilder();
		
		for(int t=0;t<10;t++) {
			int sum = 0;
			
			
			
			int N = sc.nextInt(); //tc 길이
			String str = sc.next();

			for(int i=0;i<str.length();i++) {
				if(str.charAt(i)=='*') {
					if(stack.isEmpty()) {
						//비었으면 그냥 push
						stack.push(1); //곱하기는 1로 표시
						//System.out.print(stack.peek());
					}
					else {
						//안비었으면
						if(stack.peek() == 0) {
							stack.push(1);
							//System.out.print(stack.peek());
						}
						else {
							stack.pop();
							sb.append('*');
							stack.push(1);
							//System.out.print(stack.peek());
						}
					}
					
				}
				
				else if(str.charAt(i) =='+') {
					if(stack.isEmpty()) {
						stack.push(0);
						//System.out.print(stack.peek());
					}
					else {
						sb.append(stack.peek()==1?'*':'+');
						stack.pop();
						stack.push(0);
						//System.out.print(stack.peek());
					}
				}
				else
					sb.append(str.charAt(i));
			}//후위 표기법으로 바꿈
			
			//System.out.println();
			//System.out.println(stack.size());
			while(!stack.isEmpty()) {
				char c1 = stack.peek()==0?'+':'*';
				stack.pop();
				sb.append(c1);
			}
			//System.out.println(sb.toString());
			
			Stack<Integer> number = new Stack<>();
			for(int i=0;i<sb.length();i++) {
				if(sb.charAt(i)=='+') {
					int n1 = number.pop();
					int n2 = number.pop();
					number.push(n1+n2);
				}
				else if(sb.charAt(i)=='*') {
					int n1 = number.pop();
					int n2 = number.pop();
					number.push(n1*n2);
				}
				else {
					String s = Character.toString(sb.charAt(i));
					number.push(Integer.parseInt(s));
				}
			}
			System.out.println("#"+(t+1)+" "+number.peek());
			
		}
	}
}