题目要求:
文字母组成,返回一个string,为所求的压缩后或未变化的串。
利用字符重复出现的次数,编写一个方法,实现基本的字符串压缩功能。比如,字符串“aabcccccaaa”经压缩会变成“a2b1c5a3”。若压缩后的字符串没有变短,则返回原先的字符串。
给定一个string iniString为待压缩的串(长度小于等于3000),保证串内字符均由大小写英
package CrackingtheCodingInterview;
public class ZipperStringDemo {
public static String zipString(String iniString) {
StringBuffer sb = new StringBuffer();
char[] chs = iniString.toCharArray();
int flag = 1;
int len = chs.length;
for(int i=0;i<len-1;i++){
if(chs[i] == chs[i+1] && i<len-2){
flag++;
continue;
}else if(chs[i] == chs[i+1] && i==len-2){
sb.append(chs[i]).append(flag+1);
}
else if(chs[i] != chs[i+1] && i<len-2){
sb.append(chs[i]).append(flag);
flag = 1;
}else if(chs[i] != chs[i+1] && i == len-2){
sb.append(chs[i]).append(flag).append(chs[i+1]).append(flag);
flag = 1;
}
}
if(sb.toString().length() >= len){
return iniString;
}
return sb.toString();
}
public static void main(String[] args) {
// TODO Auto-generated method stub
System.out.println(zipString("jjjjjjxxxxxxxooZLLLLLLLLQQQQQQQQQLLLLLLLLECXXXXXXXIIIIIIIIIhjjyyySSooooooooommmuuEEEEEEEEEnnnnnnnffffffAAAAAllllllllbbbbkkkkkkkkkkkkKKKKKKhhhhhhhhhooooooooooYCCCCCCOOOOOOOOOMMMMMMMMMMiiiiiivvvvvvvWWWWkkkkkkwwwwwwwMmmmmmmmmLLLwwwwwwwkkkjjjjjjttttQQQQQQQQQaaaaaaaFFFFFFFlllllllllggggggggggPPPPPPuuuuuuuuaYYYYYYwQQQFFFFFFFFFFaaaaapXXXXXXXxxxxxxQQQQQQQQQsssssGGGGfffffffddddddpppQQQQQQHHHTTTaaaaaaGGGGGGddyyyyyMhhllllllllllNNNNNNNNUUUWWWWWWLLLLLLLLLYYYYYYYYYYTTKKKKKKKKiiiiiiitttttttXXXXXXXXXLLLHZZZZZZZssssjjJJJEEEEEOOOOOttttttttttBBttttttTTTTTTTTTTrrrrttttRRRRRyyooooooaaaaaaaaarrrrrrrPPPPPPPjjPPPPddddddddddHHHHnnnnnnnnnnSSSSSSSSSSzzHHHHHHHHHddddddDDDzzzhhhhhfffffffffftttttteeeeeeeeEEEEEEEEEaaaaaaccccccccccFFFFFFFF"));
}
}
文字母组成,返回一个string,为所求的压缩后或未变化的串。