[알고리즘] 백준 9012번: 괄호 JAVA

import java.io.*;
import java.util.*;

public class Main {

    public static void main(String[] args) throws Exception {
        int N = 0;
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        N = Integer.parseInt(br.readLine());


        StringBuilder sb = new StringBuilder();

        for(int i=0;i<N;i++){
            String isVps=br.readLine();

            int stack =returnStack(isVps);

            if(stack==0){
                sb.append("YES\n");
            }else{
                sb.append("NO\n");
            }
        }
        System.out.print(sb);
    }

    public static int returnStack(String isVps){
        int result=0;
        for(int j=0;j<isVps.length();j++){
            if(isVps.charAt(j)=='('){ //0 ~ length-1
                result++;
            }else{
                if(result<=0){
                    return -1;
                }else{
                    result--;
                }
            }
        }
        return result;
    }
}

int를 스택처럼 사용하여 0보다 작으면 NO를 넣어주게 코딩하였습니다.