• 문제 링크
26111번: Parentheses Tree
A rooted ordered tree $T$ can be expressed as a string of matched parentheses $p(T)$. The string representation $p(T)$ can be defined recursively. As a base case, a tree consisting of a single node is expressed by a pair of parentheses (). When a rooted or
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));
String s = br.readLine();
Stack<Character> stk = new Stack<>();
long sum = 0;
int prev = -1;
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) == '(') stk.push(s.charAt(prev = i));
else {
stk.pop();
if (i == prev + 1) sum += stk.size();
}
}
bw.write(String.valueOf(sum));
bw.flush();
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 9204 체스 - Graph Theory / Java (0) | 2023.08.03 |
---|---|
[백준] 25416 빠른 숫자 탐색 - Graph Theory / Java (0) | 2023.08.02 |
[백준] 24393 조커 찾기 - Data Structure / Java (0) | 2023.07.31 |
[백준] 4848 집합 숫자 표기법 - Data Structure / Java (0) | 2023.07.30 |
[백준] 7585 Brackets - Data Structure / Java (0) | 2023.07.29 |
댓글