• 문제 링크
7585번: Brackets
As a C/Java programmer, you will be used to dealing with brackets. For the purpose of this problem, we will consider three type of bracket, round (), square [] and curly {}. As you know, every opening bracket must have a corresponding closing bracket, and
www.acmicpc.net
• 풀이 과정
• 풀이 코드
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Stack;
public class Main {
static Stack<Character> stk = new Stack<>();
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringBuilder sb = new StringBuilder();
String input;
while (!(input = br.readLine()).equals("#")) {
sb.append(isLegal(input) ? "Legal\n" : "Illegal\n");
stk.clear();
}
bw.write(sb.toString());
bw.flush();
}
private static boolean isLegal(String input) {
for (char c : input.toCharArray()) {
if (c == '(' || c == '[' || c == '{') stk.push(c);
else if (c == ')' && stk.pop() != '(') return false;
else if (c == ']' && stk.pop() != '[') return false;
else if (c == '}' && stk.pop() != '{') return false;
}
return stk.isEmpty();
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 24393 조커 찾기 - Data Structure / Java (0) | 2023.07.31 |
---|---|
[백준] 4848 집합 숫자 표기법 - Data Structure / Java (0) | 2023.07.30 |
[백준] 26596 황금 칵테일 - Data Structure / Java (0) | 2023.07.28 |
[백준] 15577 Prosjek - Data Structure / Java (0) | 2023.07.27 |
[백준] 14753 MultiMax - Brute Force / Java (0) | 2023.07.26 |
댓글