class Solution {
public String removeDuplicates(String S) {
StringBuilder a=new StringBuilder();
for(int i=0;i<S.length();i++){
if(a.length()==0){
a.append(S.charAt(i));
}else if(a.charAt(a.length()-1)==S.charAt(i)){
a.delete(a.length()-1,a.length());
}else{
a.append(S.charAt(i));
}
}
return a.toString();
}
}
class Solution {
public String removeDuplicates(String S) {
StringBuilder sb = new StringBuilder();
int sbLength = 0;
for (char character : S.toCharArray()) {
if (sbLength != 0 && character == sb.charAt(sbLength - 1))
sb.deleteCharAt(sbLength-- - 1);
else {
sb.append(character);
sbLength++;
}
}
return sb.toString();
}
}
作者:LeetCode
链接:https://leetcode-cn.com/problems/remove-all-adjacent-duplicates-in-string/solution/shan-chu-zi-fu-chuan-zhong-de-suo-you-xiang-lin-zh/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。