Skip to content

Commit af72f6a

Browse files
authored
Update TreeHuffmanDecoding.java
1 parent 17ebab8 commit af72f6a

File tree

1 file changed

+16
-16
lines changed

1 file changed

+16
-16
lines changed

TreeHuffmanDecoding.java

Lines changed: 16 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -63,31 +63,31 @@ class Node
6363
6464
*/
6565

66-
void decode(String s, Node root)
67-
{
68-
int n = s.length();
69-
Node currentNode = root;
70-
StringBuilder decodedHuffString = new StringBuilder();
66+
void decode(String s, Node root)
67+
{
68+
int n = s.length();
69+
Node currentNode = root;
70+
StringBuilder decodedHuffString = new StringBuilder();
71+
72+
for(int i = 0; i < n; i++)
73+
{
74+
currentNode = s.charAt(i) == '0'? currentNode.left : currentNode.right;
7175

72-
for(int i = 0; i < n; i++)
76+
if(currentNode.left == null && currentNode.right == null)
7377
{
74-
currentNode = (s.charAt(i) == '0')? currentNode.left : currentNode.right;
75-
76-
if(currentNode.left == null && currentNode.right == null)
77-
{
78-
decodedHuffString = decodedHuffString.append(currentNode.data);
79-
currentNode = root;
80-
}
78+
decodedHuffString = decodedHuffString.append(currentNode.data);
79+
currentNode = root;
8180
}
82-
83-
System.out.println(decodedHuffString.toString());
8481
}
82+
83+
System.out.println(decodedHuffString.toString());
84+
}
8585

8686

8787
}
8888

8989

90-
public class TreeHuffmanDecoding {
90+
public class Solution {
9191

9292
// input is an array of frequencies, indexed by character code
9393
public static Node buildTree(int[] charFreqs) {

0 commit comments

Comments
 (0)