๐ ์ฝ๋ฉํ
์คํธ/๋ฐฑ์ค & ํ๋ก๊ทธ๋๋จธ์ค
[SWEA][JAVA]D4 : ๊ดํธ ์ง์ง๊ธฐ
deep_lee
2022. 11. 19. 17:26
https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14eWb6AAkCFAYD
SW Expert Academy
SW ํ๋ก๊ทธ๋๋ฐ ์ญ๋ ๊ฐํ์ ๋์์ด ๋๋ ๋ค์ํ ํ์ต ์ปจํ ์ธ ๋ฅผ ํ์ธํ์ธ์!
swexpertacademy.com
Stack ํ์ฉ ๊ธฐ๋ณธ๋ฌธ์
์คํ์ ์ฐจ๋ก๋๋ก ๋ฃ์ผ๋ฉด์, ์ต์๋จ(peek)๊ฐ ์ฌ๋๊ดํธ๊ณ ํ์ฌ ์ ๋ ฅ๋ x๊ฐ ๋ซ๋๊ดํธ๋ฉด ์ต์๋จ ๊ฐ์ pop()
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner kb = new Scanner(System.in);
int T = 10;
for (int t = 1; t <= T; t++) {
int n=kb.nextInt();
String s=kb.next();
Stack<Character> stack=new Stack<>();
for(char x:s.toCharArray()){
if(x==')' && stack.peek()==('(')) stack.pop();
else if(x==']' && stack.peek()==('[')) stack.pop();
else if(x=='}' && stack.peek()==('{')) stack.pop();
else if(x=='>' && stack.peek()==('<')) stack.pop();
else stack.push(x);
}
if(stack.isEmpty()) System.out.println("#"+t+" "+1);
else System.out.println("#"+t+" "+0);
}
}
}