Skip to main content
 首页 » 编程设计

python之两个字符串列表python之间的交集

2024年10月24日30softidea

这是引用在 Java 中完成的问题:
Finding the intersection between two list of string candidates .

我试图在 python 中找到一个等效的解决方案:

def solution(S): 
    length = len(S) 
    if length == 0: 
        return 1 
    count = 0 
    i = 0 
    while i <= length: 
        prefix = S[0:i:] 
        suffix = S[length-i:length] 
        print suffix 
        if prefix == suffix: 
            count += 1 
        i += 1 
    return count 
 
print solution("") 
print solution("abbabba")     
print solution("codility") 

我知道我没有在后缀方面做这一步。

我得到的值是 1,4,2 而不是 1,4,0​​

请您参考如下方法:

您当前的代码通过为后两个示例提供以下前缀、后缀对来运行:

a a 
ab ba 
abb bba 
abba abba 
abbab babba 
abbabb bbabba 
abbabba abbabba 
 
c y 
co ty 
cod ity 
codi lity 
codil ility 
codili dility 
codilit odility 
codility codility 

我假设您正在尝试返回字符串的前 n 个字符与最后一个 n 相同的次数。 codility 返回 2 的原因是因为您从零开始索引,所以它匹配空字符串和完整字符串。试试看:

def solution(S): 
    length = len(S) 
    if length == 0: 
        return 1 
    count = 0 
    i = 1 # Don't test the empty string! 
    while i < length: # Don't test the whole string! Use '<' 
        prefix = S[:i] # Up to i 
        suffix = S[length-i:] # length - i to the end 
        print prefix, suffix 
        if prefix == suffix: 
            count += 1 
        i += 1 
    return count 
 
print solution("") 
print solution("abbabba")     
print solution("codility") 

这将返回 1、2、0。

也许您想要测试前缀是否与后缀相同向后,并且只测试字符串长度的一半?在这种情况下,您应该尝试以下操作:

def solution(S): 
    length = len(S) 
    if length == 0: 
        return 1 
    count = 0 
    i = 1 # Don't test the empty string! 
    while i <= (length + 1)/2: # Test up to halfway 
        prefix = S[:i] # Up to i 
        suffix = S[:length-i-1:-1] # Reverse string, up to length - i - 1 
        print prefix, suffix 
        if prefix == suffix: 
            count += 1 
        i += 1 
    return count 
 
print solution("") 
print solution("abbabba")     
print solution("codility") 

这将返回 1、4、0。