programmers_괄호 회전하기_java

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

프로그래머스

import java.util.*;

class Solution {
    public int solution(String s) {
        int answer = 0;
        
        int sLength = s.length();
        
        for(int i = 0; i< sLength; i++){
            Stack<Character> stack = new Stack<>();
            int idx = i;
            boolean flag = true;
            for (int j = 0 ; j< sLength; j++){
                switch(s.charAt((idx + j) % sLength)){
                    case '(' : case '[' : case '{' :
                        stack.push( s.charAt((idx + j) % sLength) );
                        break;                        
                    case ')' : 
                        if(!stack.empty() && stack.peek() == '('){
                            stack.pop();
                        }else{
                           flag = false;
                        }
                        break;
                    case ']' : 
                        if(!stack.empty() && stack.peek() == '['){
                            stack.pop();
                        }else{
                           flag = false;
                        }
                        break;
                    case '}' :
                        if(!stack.empty() && stack.peek() == '{'){
                            stack.pop();
                        }else{
                           flag = false;
                        }
                        break;
                }
                if(!flag) break;
            }
            if(flag && stack.isEmpty()) answer++;
        }
        
        return answer;
    }
}