leetcode/algorithms/StringCompression/Solution.java at master · P-ppc/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
class Solution {
    public int compress(char[] chars) {
        Character ch = null;
        int count = 0,
            length = 0;

        for (char c : chars) {
            if (ch == null) {
                count = 1;
                ch = c;
            } else if (ch == c) {
                count++;
            } else if (ch != c) {
                chars[length] = ch;
                length++;

                if (count > 1) {
                    String countStr = String.valueOf(count);
                    for (int j = 0; j < countStr.length(); j++) {
                        chars[length] = countStr.charAt(j);
                        length++;
                    }
                }

                count = 1;
                ch = c;
            }
        }

        chars[length] = ch;
        length++;

        if (count > 1) {
            String countStr = String.valueOf(count);
            for (int j = 0; j < countStr.length(); j++) {
                chars[length] = countStr.charAt(j);
                length++;
            }
        }

        return length;
    }
}