实施后缀树

问题描述

下午好。我正在尝试将代码从C ++重写为python，但出现关键错误：最后几行为0： 对于范围在（256）中的c： 链接[0] [c] = 1;

我看过一个向SortedDict添加值的示例：sd ['c'] = 3，但是我不知道自己在做什么错。

需要解决什么？

#include <string>
#include <map>

const int MAXLEN = 600000; 
std::string s;
int pos[MAXLEN],len[MAXLEN],par[MAXLEN];
std::map<char,int> to[MAXLEN],link[MAXLEN];
int sz = 2;
int path[MAXLEN];

void attach(int child,int parent,char c,int child_len)
{
    to[parent][c] = child;
    len[child] = child_len;
    par[child] = parent;
}
void extend(int i) 
{
    int v,vlen = s.size() - i,old = sz - 1,pstk = 0; 
    for (v = old; !link[v].count(s[i]); v = par[v]) {
        vlen -= len[v];
        path[pstk++] = v;
    }
    int w = link[v][s[i]]; 
    if (to[w].count(s[i + vlen])) {
        int u = to[w][s[i + vlen]]; 
        for (pos[sz] = pos[u] - len[u]; s[pos[sz]] == s[i + vlen]; pos[sz] += len[v]) {
            v = path[--pstk];
            vlen += len[v];
        }
        attach(sz,w,s[pos[u] - len[u]],len[u] - (pos[u] - pos[sz]));
        attach(u,sz,s[pos[sz]],pos[u] - pos[sz]);
        w = link[v][s[i]] = sz++;
    }
    link[old][s[i]] = sz;
    attach(sz,s[i + vlen],s.size() - (i + vlen));
    pos[sz++] = s.size();
}
int main()
{
    len[1] = 1; pos[1] = 0; par[1] = 0;
    for (int c = 0; c < 256; c++)
        link[0][c] = 1; 
    s = "abababasdsdfasdf";
    for (int i = s.size() - 1; i >= 0; i--)
        extend(i);
}

和python：

#pip install sortedcontainers
from sortedcontainers import SortedDict

MAXLEN = 600000
s = ""
#pos = []
#leng = []
#par = []

pos = [None]*MAXLEN
leng = [None]*MAXLEN
par = [None]*MAXLEN

to = SortedDict()
link = SortedDict()
sz = 2
path = []

def attach(child,parent,c,child_len):
    to[parent][c] = child
    leng[child] = child_len
    par[child] = parent

def extend(i): 
    vlen = len(s) - i
    old = sz - 1
    pstk = 0;
    
    v = old
    while 1:
        if link[v].count(s[i]):
            break
        vlen -= leng[v]
        path[pstk + 1] = v
        v = par[v]
     
    w = link[v][s[i]]
    
    if to[w].count(s[i + vlen]):
        u = to[w][s[i + vlen]]
        
        pos[sz] = pos[u] - leng[u]
        while 1:
            if s[pos[sz]] != s[i + vlen]:
                break
            v = path[pstk - 1]
            vlen += leng[v]
            pos[sz] += leng[v]
        
        attach(sz,s[pos[u] - leng[u]],leng[u] - (pos[u] - pos[sz]))
        attach(u,pos[u] - pos[sz])
        w = link[v][s[i]] = sz + 1
    
    link[old][s[i]] = sz
    attach(sz,len(s) - (i + vlen))
    pos[sz + 1] = len(s)

    
leng[1] = 1;
pos[1] = 0;
par[1] = 0;

for c in range(256):
    link[0][c] = 1;
s = "abababasdsdfasdf";
i = len(s) - 1;
while 1:
    if i <= 0:
        break
    extend(i)
    i -= 1

解决方法

暂无找到可以解决该程序问题的有效方法，小编努力寻找整理中！

如果你已经找到好的解决方法，欢迎将解决方案带上本链接一起发送给小编。

小编邮箱:dio#foxmail.com (将#修改为@）