public int compress(char[] chars) { int indexAns = 0, index = 0; while(index < chars.length){ char currentChar = chars[index]; int count = 0; while(index < chars.length && chars[index] == currentChar){ index++; count++; } chars[indexAns++] = currentChar; if(count != 1) for(char c : Integer.toString(count).toCharArray()) chars[indexAns++] = c; } return indexAns; }
443. String Compression(in place算法)
猜你喜欢
转载自www.cnblogs.com/haojiesky/p/12216769.html
今日推荐
周排行