-
Notifications
You must be signed in to change notification settings - Fork 0
/
Question50.java
32 lines (26 loc) · 1.04 KB
/
Question50.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
/* You are given a binary string consisting of a sequence of 1s and 0s. This binary string is an encoded version of an English word. Each uppercase letter in the word id
represented by a sequence of 1s of varying length while 0s act as separator between these sequence. Your task is to decode the binary string and determine the original word.*/
import java.util.*;
public class Question50{
public static String decodedString(String s){
StringBuilder sb = new StringBuilder();
int count = 0;
for(int i=0;i<s.length();i++){
char currentChar = s.charAt(i);
if(currentChar == '1'){
count++;
}else if(currentChar == '0' && count > 0){
sb.append((char)('A' + count -1));
count = 0;
}
}
if(count>0){
sb.append((char)('A' + count - 1));
}
return sb.toString();
}
public static void main(String args[]){
String s = "1110101111";
System.out.println(decodedString(s));
}
}