Leetcode-problems/problem443.java at main · tejatayi/Leetcode-problems · 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
44
45
46
47
48
49
50
51
52
53
54
55
//443. String Compression


public class problem443 {
    public static int compress(char[] s) {

            int read=0,write=0;

            while(read<s.length)
            {
                char tem = s[read];
                s[write]=tem;
                write++;

                int c=1;
                read++;

                while ( read<s.length && s[read]==tem) {

                    c++;
                    read++;

                }

                if(c>1)
                {
                    char [] num = String.valueOf(c).toCharArray();

                    for(int i=0;i<num.length;i++)
                    {
                        s[write]=num[i];
                        write++;
                    }

                }

            }

            return write;

        }

        public static void main(String[] args) {

            char [] c = {'a','a','b','b','c','c','c'};

            int ans = compress(c);

            for(int i=0;i<ans;i++)
            {
                System.out.print(c[i]+" ");
            }

    }
}