[Programmers] 괄호 변환

[Level 2] 괄호 변환

https://programmers.co.kr/learn/courses/30/lessons/60058

 

 

 

Solution

• 문제에서 주어진 조건대로 재귀 함수로 구현하여 풀 수 있었다.

 

 

소스코드

import java.util.*;
class Solution {  
    static StringBuilder sb;
    public String solution(String p) {
        String answer = "";
        return recursive(p);   
    }
    
    public static boolean isCorrect(String s){
        int count = 0;
        for(int i = 0; i<s.length(); i++){
            if(s.charAt(i) == '(')
                count++;
            else
                count--;
            if(count <0 ) return false;
        }
        return true;
    }
    public static String recursive(String w){
        if(w.equals("")) return "";
         String u = devide(w);
         String v = w.substring(u.length(), w.length());
        if(isCorrect(u)){
            return u + recursive(v);
        }else{
           String temp = "(" + recursive(v) + ")";
            u = u.substring(1, u.length()-1);
            sb = new StringBuilder();
            for(int i = 0; i<u.length(); i++){
                if(u.charAt(i) == '(')
                    sb.append(")");
                else
                    sb.append("(");
            }
           return temp + sb.toString();
        }
    }
    
    public static String devide(String p){
        sb = new StringBuilder();
        int open = 0, close = 0;
        for(int i = 0; i< p.length();i++){
            if(p.charAt(i) == '('){
                open++;
                sb.append("(");
            }else{
                close++;
                sb.append(")");
            }
            
            if(open == close){
               break;
            }
        }
        return sb.toString();
    }
}