No434.java

packageAlgorithm.leetcode.String;

/**
 * 
 * Created by tujietg on Nov 6, 2019
 */
publicclassNo434 {
publicintcompress(char[] chars) {
intindex = 0;
intendindex = 0;
while (index < chars.length) {
charcurrent = chars[index];
intcount = 0;
while (index < chars.length && current == chars[index]) {
count++;
index++;
 }

chars[endindex++] = current;

if (count != 1) {
for (charitem : Integer.toString(count).toCharArray()) {
chars[endindex++] = item;
 }
 }
 }
returnendindex;
 }
}