[프로그래머스, 76502] 괄호 회전하기 (java)

https://school.programmers.co.kr/learn/courses/30/lessons/76502

프로그래머스

---

메모리: 87 MB, 시간: 569.57 ms

사용 알고리즘: 스택

import java.util.*;

class Solution {
    public int solution(String s) {
        
        int answer = 0;
        
        List<Character> sList = new LinkedList<>();
        for(int i = 0; i < s.length(); i++) {
            sList.add(s.charAt(i));
        }
        
        Stack<Character> stack = new Stack<>();
        boolean flag;
        for(int i = 0; i < s.length(); i++) {
            flag = true;
            
            for(int j = 0; j < sList.size(); j++) {
                if(sList.get(j) == '(' || sList.get(j) == '{' || sList.get(j) == '[')
                    stack.push(sList.get(j));
                else if((sList.get(j) == ')' && !stack.isEmpty() && stack.peek() == '(') ||
                        (sList.get(j) == '}' && !stack.isEmpty() &&  stack.peek() == '{') ||
                        (sList.get(j) == ']' && !stack.isEmpty() &&  stack.peek() == '['))
                            stack.pop();
                else {
                    flag = false;
                    break;
                }
            }
            
            if(stack.size() != 0) flag = false;
            
            if(flag) answer++;
            
            sList.add(sList.get(0));
            sList.remove(0);
        }
        
        return answer;
    }
}