이도현

... Stack<Character> stk = new Stack<>(); for (int i = 0; i < s.length(); i++) { if (s.charAt(i) == '(') stk.push(s.charAt(i)); else { if (stk.isEmpty()) return false; else stk.pop(); } } answer = (stk.isEmpty()) ? true : false; return answer; ...

//올바른 괄호. for 내 조건 풀이 class CorrectBrackets { static boolean solution(String s) { boolean answer = false; int count = 0; for (int i = 0; i < s.length(); i++) { if (s.charAt(i) == '(') count++; if (s.charAt(i) == ')') count--; if (count < 0) break; } if (count == 0) answer = true; return answer; } }