package NiuKeNet;
import java.util.LinkedHashSet;
import java.util.Set;
public class Removesamestring {
public static void main(String[] args) {
System.out.println(removerepeatedchar("ddddccffgd"));
}
public static String removerepeatedchar(String s) {
if (s == null)
return s;
StringBuffer sb = new StringBuffer();
int i = 0, len = s.length();
while (i < len) {
char c = s.charAt(i);
sb.append(c);
i++;
while (i < len && s.charAt(i) == c) {
i++;
}
}
return sb.toString();
}
private static String removesamestring(String str) {
Set<String> mlinkedset = new LinkedHashSet<String>();
String[] strarray = str.split(" ");
StringBuffer sb = new StringBuffer();
for (int i = 0; i < strarray.length; i++) {
if (!mlinkedset.contains(strarray[i])) {
mlinkedset.add(strarray[i]);
sb.append(strarray[i] + " ");
}
}
System.out.println(mlinkedset);
return sb.toString().substring(0, sb.toString().length() - 1);
}
}
字符串操作---去重
猜你喜欢
转载自blog.csdn.net/hd12370/article/details/81711642
今日推荐
周排行