업데이트 :: 2018.08.23 문제코드결과문제Stacks and Queues > Brackets Determine whether a given string of parentheses (multiple types) is properly nested. 코드1차 풀이import java.util.*; class Solution { public int solution(String S) { if(S.equals("")) return 1; int count = 0; int flag = 0; // () 0, {} 1, [] 2 Stack stack = new Stack(); for(int i=0; i 0) { if(stack.pop() != 0) return 0; } else return 0; break; cas..