leetcode 1047. Remove All Adjacent Duplicates In String

Seawolf

1. Given a string S of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them.
   
2. 
   
3. We repeatedly make duplicate removals on S until we no longer can.
   
4. 
   
5. Return the final string after all such duplicate removals have been made.  It is guaranteed the answer is unique.
   
6. 
   
7. 
   
8. 
   
9. Example 1:
   
10. 
    
11. Input: "abbaca"
    
12. Output: "ca"
    
13. Explanation:
    
14. 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".
    
15. 
    
16. 
    
17. Note:
    
18. 
    
19. 1 <= S.length <= 20000
    
20. S consists only of English lowercase letters.

复制代码

1. class Solution {
   
2.     public String removeDuplicates(String S) {
   
3.         if(S.length() == 0) return S;
   
4.         int i = 0;
   
5.         while(i != S.length()){
   
6.             if(i < S.length() -1 && S.charAt(i) == S.charAt(i+1)){
   
7.                 S = S.substring(0, i)+S.substring(i+2);
   
8.                 break;
   
9.             }
   
10.             i++;
    
11.         }
    
12.         if(i == S.length()) return S;
    
13.         return removeDuplicates(S);
    
14.     }
    
15. }

复制代码

1. class Solution {
   
2.     public String removeDuplicates(String S) {
   
3.         List<Character> list = new ArrayList<>();
   
4.         for(int i = 0; i < S.length(); i++){
   
5.             if(list.size() != 0 && list.get(list.size() - 1)  == S.charAt(i)){
   
6.                 list.remove(list.size()-1);
   
7.             }else{
   
8.                 list.add(S.charAt(i));
   
9.             }
   
10.         }
    
11.         
    
12.         String ret = "";
    
13.         for(int i = 0; i < list.size(); i++){
    
14.             ret = ret + list.get(i);
    
15.         }
    
16.         return ret;
    
17.     }
    
18. }

复制代码

1. class Solution {
   
2.     public String removeDuplicates(String S) {
   
3.         char[] s = S.toCharArray();
   
4.         int i = 0;
   
5.         for(int j = 0; j< s.length; j++){
   
6.             if(i>0 && s[i-1] == s[j]){
   
7.                 i--;
   
8.             }
   
9.             else{
   
10.                 s[i++] = s[j];
    
11.             }
    
12.         }
    
13.         
    
14.         return new String(s,0,i);
    
15.     }
    
16. }

复制代码