1047. Remove All Adjacent Duplicates In String

标签：answer   har   while   ace   lower   public   pre   nat   for   

Given a string S of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them.

We repeatedly make duplicate removals on S until we no longer can.

Return the final string after all such duplicate removals have been made.  It is guaranteed the answer is unique.

Example 1:

Input: "abbaca"
Output: "ca"
Explanation: 
For example, in "abbaca" we could remove "bb" since the letters are adjacent and equal, and this is the only possible move.  The result of this move is that the string is "aaca", of which only "aa" is possible, so the final string is "ca".

 1 class Solution {
 2     public String removeDuplicates(String S) {
 3         if(S == null || S.length() == 0) return S;
 4         Stack<Character> stack = new Stack();
 5         StringBuilder sb = new StringBuilder();
 6         for(int i = 0; i < S.length(); i++) {
 7             if(!stack.isEmpty() && stack.peek() == S.charAt(i)) {
 8                 stack.pop();
 9             } else {
10                 stack.push(S.charAt(i));
11             }
12         }
13         while(!stack.isEmpty()) {
14             sb.append(stack.pop());
15         }
16         return sb.reverse().toString();
17     }
18 }

1047. Remove All Adjacent Duplicates In String

标签：answer   har   while   ace   lower   public   pre   nat   for   

原文地址：https://www.cnblogs.com/beiyeqingteng/p/12271879.html