• 문제 링크
16815번: Star in Parentheses
You are given a string $S$, which is balanced parentheses with a star symbol * inserted. Any balanced parentheses can be constructed using the following rules: An empty string is balanced. Concatenation of two balanced parentheses is balanced. If $T$ is ba
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 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
char[] arr = br.readLine().toCharArray();
Stack<Character> stk = new Stack<>();
for (int i = 0; arr[i] != '*'; i++) {
if (arr[i] == '(') stk.push(arr[i]);
else stk.pop();
}
bw.write(String.valueOf(stk.size()));
bw.flush();
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 14544 Vote - Data Structure / Java (0) | 2023.09.12 |
---|---|
[백준] 11235 Polling - Data Structure / Java (0) | 2023.09.11 |
[백준] 18679 Banana - Data Structure / Java (0) | 2023.09.09 |
[백준] 5089 Travelling Salesman - Data Structure / Java (0) | 2023.09.08 |
[백준] 15098 No Duplicates - Data Structure / Java (0) | 2023.09.07 |
댓글