View difference between Paste ID: KkAqQHSu and 3Ryguuvn
SHOW: | | - or go back to the newest paste.
1-
import provided.BinaryTree;
1+
2-
2+
3
    public String dekodieren(String code) {
4
        BinaryTree h = new BinaryTree("h");
5-
    static final BinaryTree tree;
5+
6
        BinaryTree f = new BinaryTree("f");
7-
    static {
7+
8
        BinaryTree l = new BinaryTree ("l");
9
        BinaryTree ä = new BinaryTree ("ä");
10
        BinaryTree p = new BinaryTree ("p");
11
        BinaryTree j = new BinaryTree ("j");
12
        BinaryTree b = new BinaryTree ("b");
13
        BinaryTree x = new BinaryTree ("x");
14
        BinaryTree c = new BinaryTree ("c");
15
        BinaryTree y = new BinaryTree ("y");
16
        BinaryTree z = new BinaryTree ("z");
17
        BinaryTree q = new BinaryTree ("q");
18
        BinaryTree ö = new BinaryTree ("ö");
19
        BinaryTree ch = new BinaryTree ("ch");
20
        BinaryTree s = new BinaryTree ("s", h, v);
21
        BinaryTree u = new BinaryTree ("u", f, ü);
22
        BinaryTree r = new BinaryTree ("r", l, ä);
23
        BinaryTree w = new BinaryTree ("w", p, j);
24
        BinaryTree d = new BinaryTree ("d", b, x);
25
        BinaryTree k = new BinaryTree ("k", c, y);
26
        BinaryTree g = new BinaryTree ("g", z, q);
27
        BinaryTree o = new BinaryTree ("o", ö, ch);
28
        BinaryTree i = new BinaryTree ("i", s, u);
29
        BinaryTree a = new BinaryTree ("a", r, w);
30
        BinaryTree n = new BinaryTree ("n", d, k);
31
        BinaryTree m = new BinaryTree ("m", g, o);
32
        BinaryTree e = new BinaryTree ("e", i, a);
33
        BinaryTree t = new BinaryTree ("t", n, m);
34
        BinaryTree baum = new BinaryTree(" ", e, t);
35
    
36
        String dekodiert = "";
37
        for(int i = 0; i < code.length() - 1; i++) {
38-
        tree = new BinaryTree(" ", e, t);
38+
39
            if(c == ' ') {
40
                dekodiert = dekodiert + c;
41-
    public static String encode(String code) {
41+
42-
        String encoded = "";
42+
43-
        return encoded;
43+
            BinaryTree unterbaum = null;
44
            if(c == '-')
45
                unterbaum = baum.getRightTree();
46-
    public static String decode(String code) {
46+
            else if(c == '.')
47-
        String decoded = "";
47+
                unterbaum = baum.getLeftTree();
48-
        BinaryTree node = tree;
48+
49
                baum = unterbaum;
50
            else 
51
                break;
52-
                decoded += c;
52+
            if(baum.getObject() != null)
53
                dekodiert = dekodiert + node.getObject();
54
        }
55-
            BinaryTree child = c == '-' ? node.getRightTree() : c == '.' ? node.getLeftTree() : null;
55+
        return dekodiert;
56
    }
57-
                node = child;
57+
58
}