최's 먹공로그
SW expert Academy 5432_쇠막대기 자르기 본문
https://www.swexpertacademy.com/main/code/problem/problemDetail.do
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44 |
import java.util.Arrays;
import java.util.Scanner;
import java.util.Stack;
public class Solution_5432_쇠막대기자르기_최성호 {
static int sum = 0;
public static void main(String[] args) {
Stack<Character> stack = new Stack<>();
Scanner sc = new Scanner(System.in);
int T = sc.nextInt();
//sc.nextLine();
for (int tc = 1; tc <= T; tc++) {
sum = 0;
String arr = sc.next();
char[] arr2 = new char[arr.length()];
for(int i = 0; i < arr.length(); i ++) {
arr2[i] = arr.charAt(i);
}
for(int i = 0; i < arr.length(); i ++) {
if(arr2[i] == '(') {
stack.push(arr2[i]);
}
if(arr2[i] == ')' && arr2[i-1] == '(') { // 레이저일때
stack.pop();
sum += stack.size();
}
if(arr2[i] == ')' && arr2[i-1] == ')') { // 쇠막대가 끝
stack.pop();
sum += 1;
}
}
System.out.println("#" + tc + " " + sum);
} // end of tc
} // end of main
}
|
cs |
'APS' 카테고리의 다른 글
| SW expert Academy 1223_[S/W 문제해결 기본]6일차_계산기2 (0) | 2019.02.03 |
|---|---|
| SW expert Academy 1218_[S/W 문제해결 기본] 4일차_괄호 짝짓기 (0) | 2019.02.03 |
| SW expert Academy 1210_[S/W 문제해결 기본] 2일차_Ladder1 (0) | 2019.02.03 |
| SW expert Academy 1208_[S/W 문제해결 기본]1일차_Flatten (0) | 2019.02.03 |
| SW expert Academy 5431_민석이의 과제 체크하기 (0) | 2019.02.03 |