写一个方法获取参数字符串中所有但不重复的字符:123abc123abcd---123abcd
public String case(String str) {
String x = new String();
while (str.length()>0){
x+=str.charAt(0);
str = str.replaceAll(String.valueOf(str.charAt(0)), "");
}
str = x;
return str;
}
写一个方法打印参数字符串中每个字符出现的次数。
public void case(String str){
char[] chars = str.toCharArray();
Arrays.sort(chars);
for (int i = 0; i < chars.length; i++) {
int count = 0;
for (int j = i; j < chars.length; j++) {
if(chars[i]==chars[j]){
count++;
i=j;
}
}
System.out.println(chars[i]+" 出现了 "+count+" 次");
}
}
写一个方法获取参数字符串中所有数字字符对应的最大整数:abc109yh7---9710
public void case(String str){
//先取出数字
String max = new String();
for (char c : str.toCharArray()) {
if (c>=48&&c<=57){
max+=c;
}
}
char[] chars = max.toCharArray();
//排序后,进行反转
Arrays.sort(chars);
char[] char = chars.toCharArray();
char[] arr = new char[str.length()];
for (int i = 0; i < char.length; i++) {
arr[char.length - 1 - i] = chars[i];
}
String s = new String(arr);
System.out.println(s);
}
写一个方法 去除叠词 :aaabccccb11122276---abcb1276
public void case(String str){
String s = new String();
boolean flag = false;
char[] chars = str.toCharArray();
for (int i = 0; i < chars.length; i++) {
for (int j = i; j < chars.length; j++) {
if (chars[i]==chars[j]){
flag = true;
i=j;
}else {
break;
}
}
if (flag){
s+=chars[i];
}
}
System.out.println(s);
}