So I have this code snippet to translate a string into bitset.
String huffmancode = "0010110100";
char[] ch = huffmancode.toCharArray();
BitSet bs = new BitSet();
for (int i = 0; i < ch.length; i++) {
if (ch[i] == '1') {
bs.set(i);
}
}
My question is how to determine the boundary / size / length of the bitset given that the first and the last indexes of huffman code were 0's ?
The following bitset contains [0,1] in order and the last line of the following code prints out
2
, the length of the bitset.