스택을 활용하여 문제풀기
import java.util.*;
class Solution
{
public int solution(String s)
{
int answer = 0;
Stack<Character> stack = new Stack<>();
stack.push(s.charAt(0));
for (int i = 1; i < s.length() ; i++) {
if (stack.size() > 0 && stack.peek() == s.charAt(i)){
stack.pop();
}
else {
stack.push(s.charAt(i));
}
}
if (stack.size() == 0)
answer = 1;
return answer;
}
}