-
Notifications
You must be signed in to change notification settings - Fork 82
/
Copy pathCompressString.java
65 lines (55 loc) · 1.75 KB
/
CompressString.java
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
56
57
58
59
60
61
62
63
64
65
/*
Write a program to do basic string compression.
For a character which is consecutively repeated more than once, replace consecutive duplicate occurrences with the count of repetitions.
Example:
If a string has 'x' repeated 5 times, replace this "xxxxx" with "x5".
The string is compressed only when the repeated character count is more than 1.
Note :Consecutive count of every character in the input string is less than or equal to 9.
Input Format:
The first and only line of input contains a string without any leading and trailing spaces.
Output Format:
The only line of output prints the updated string.
Note: You are not required to print anything. It has already been taken care of.
Constraints:
0 <= N <= 10^6
Where N is the length of the input string.
Time Limit: 1 second
Sample Input 1:
aaabbccdsa
Sample Output 1:
a3b2c2dsa
Sample Input 2:
aaabbcddeeeee
Sample Output 2:
a3b2cd2e5
*/
public class CompressString {
public static String getCompressedString(String input) {
//Your code goes here.
String output=""+input.charAt(0);
int count=1;
for (int i=1;i<input.length();i++)
{
if (input.charAt(i) != input.charAt(i-1))
{
//System.out.println("Count of " + input.charAt(i-1) + " = " + count);
if (count>1)
{
output=output+Integer.toString(count);
}
output=output+input.charAt(i);
count=1;
}
else
{
count=count+1;
}
}
if (count>1)
{
output=output+Integer.toString(count);
}
//System.out.println(output);
return output;
}
}