2022-12-20 23:50:51 +09:00
|
|
|
// [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/12973
|
|
|
|
|
|
2022-12-20 23:54:05 +09:00
|
|
|
import java.util.Stack;
|
|
|
|
|
class Solution{
|
|
|
|
|
public int solution(String s){
|
|
|
|
|
Stack<Character> stack = new Stack<>();
|
2022-12-20 23:50:51 +09:00
|
|
|
for(char ss : s.toCharArray()){
|
2022-12-20 23:54:05 +09:00
|
|
|
if(!stack.empty() && stack.peek() == ss) stack.pop();
|
|
|
|
|
else stack.push(ss);
|
2022-12-20 23:50:51 +09:00
|
|
|
}
|
2022-12-20 23:54:05 +09:00
|
|
|
return (stack.empty())?1:0;
|
2022-12-20 23:50:51 +09:00
|
|
|
}
|
|
|
|
|
}
|