我们来做一个简单的输入:

A B C A B A B C A B
0 1 2 3 4 5 6 7 8 9

据我理解，算法是这样工作的:

0,0,A - distance 0, length 0, value A
0,0,B - distance 0, length 0, value B
0,0,C - distance 0, length 0, value C
2,2,A - distance 2(from position of 4th A, we're going back 3 steps but we count from 0, so 3-1=2, 
length 2 (because its AB), value A 
4,3,B - distance 4(5 steps, but we count from 0 so 5-1=4), length 3( we take BCA because we're almost 
at the end of the file so we need the last character to stop)
Decoding:
0,0,A => A
0,0,B => AB
0,0,C => ABC
2,2,A => ABCABA ( from C we count backwards so 0, 1, 2 => we end up on A and the length is 2 => we got AB and we finish with A
4,3,B => ABCABABCAB

现在我在代码(C#):

for (int i = 0; i <BytesRead.Length; i++)
            {
           
                if(i == 0) mytoken.Add(new Token() { dist = 0, leng = 0, val = BytesRead[i]});
                
                else
                {
                    while (compare(BytesRead, i, 0) != 0)
                        mytoken.Add(new Token() { dist =d, leng = l-1, val = BytesRead[i+1] });
                }
            }

和我的比较函数:

byte compare(byte[] b, int i, int j)
        {
            int z = i;
            if (z == j) return 0; // if j==i we stop

            if (BytesRead[i]==BytesRead[j])  {l++; } //if i!=j we count the length  
            if (b[i] == b[j]) // if we found a match we:
            {
                d = 0;
                int x = i;
                while(x>0)
                {
                    x--;
                   d++; //calculate the distance 
                }
            }
            return compare(b, i, j + 1); //go to next byte
        }

我如何使算法工作？我说对了吗？我真的很难在代码中转置算法。纸面上是别的东西。我正在寻找最容易实现的版本，我不想要任何花哨的东西。