华为面试

一面

顺时针矩阵访问

https://blog.csdn.net/qq_42233538/article/details/108480778

二面

 思路：

1.生成最终字符串的列表，将列表中尾部相同的子字符串去掉，生成一个只有只包含最终字符的列表；

删除列表中所有尾部子字符串（例“abc”是“dabc”的子字符串）——分向后查找、向前查找两步；

2.生成索引、编码后的字符串

代码1

words=['me','ti','stime','bell','time']
start_s=''
indexs=[]
results=[]
n=len(words)
#向后查找列表中是否有字符串尾部包含该子字符串，如果有则删除该字符串；（相当于后向删除多余子字符串）
for i in range(0,len(words)):
    flage=0
    for j in range(i+1,len(words)):
        if (words[i] in words[j]) and (words[j].index(words[i])+len(words[i])==len(words[j])):
            flage=1
    if flage==0:
        results.append(words[i])
print(results)
#向前将字符串插入到编码字符串中，同时判定编码字符串中是否已经包含该字符串（相当于前向删除多余子字符串）
for i in range(0, len(words)):
    if words[i] in results:
        if words[i]+'#' not in start_s:
            indexs.append(len(start_s))
            start_s+=(words[i]+'#')
        else:
            indexs.append(start_s.index(words[i]+'#'))
    else:
        flage=0
        for j in range(len(results)):
            if words[i] in results[j]:
                if words[i] not in start_s:
                    start_s += (results[j] + '#')
                flage=1
                break
        if flage==1 :
            indexs.append(start_s.index(words[i]))
        else:
            indexs.append(len(start_s))
            start_s+=(words[i]+"#")
print(start_s)
print(indexs)

代码2：

# words=['me','ti','stime','bell','time']
words=['time','me','bell']
n=len(words)
start_s=''
indexs=[]
words_res=[]
words_ver=[[0 for i in range(n)] for j in range(n)]
for i in range(n):
    for j in range(n):
        if (words[i] in words[j]) and (words[j].index(words[i])+len(words[i])==len(words[j])):
            words_ver[i][j]=1
    if sum(words_ver[i])==1:
        words_res.append(words[i])
words_str='#'.join(words_res)
words_str+='#'
print(words_str)
for i in range(n):
    str_find=words[i]+'#'
    # print(str_find)
    indexs.append(words_str.index(str_find))
print(indexs)