数据结构与算法Python--（二）算法分析

最新推荐文章于 2023-07-29 14:01:44 发布

睡醒了叭

最新推荐文章于 2023-07-29 14:01:44 发布

阅读量214

点赞数

文章标签：数据结构算法 python

本文链接：https://blog.csdn.net/qq_43252507/article/details/104647885

版权

def method1(w_1,w_2):
    alist = list(w_2)
    print(alist)
    pos1 = 0
    OK = True
    while pos1 < len(w_1) and OK:
        pos2 = 0
        found = False
        while pos2 < len(alist) and not found:
            if w_1[pos1] == alist[pos2]:
                found = True
            else:
                pos2 += 1
        if found:
            alist[pos2] = None
            print(alist)
        else:
            OK = False
        pos1 = pos1 + 1
    return OK
print(method1('abcd','dcba'))

def method2(w_1,w_2):
    alist1 = list(w_1)
    alist2 = list(w_2)
    alist1.sort()
    alist2.sort()
    pos = 0
    matches = True
    while pos < len(w_1) and matches:
        if alist1[pos] == alist2[pos]:
            pos = pos+1
        else:
            matches = False
    return matches
print(method2('abcd','dcbf'))

def method3(w_1,w_2):
    alist1 = list(w_1)
    alist2 = list(w_2)
    matches = False
    list1 = itertools.permutations(alist1)
    list2 = itertools.permutations(alist2)
    for one in list1:
        for two in list2:
            if one == two:
                matches = True
    return matches
print(method2('abcd','dcbf'))

ord() 函数是 chr() 函数（对于8位的ASCII字符串）或 unichr() 函数（对于Unicode对象）的配对函数

def method4(w_1,w_2):
    c1 = [0] * 26
    c2 = [0] * 26
    for i in range(len(w_1)):
        pos = ord(w_1[i]) - ord('a')
        c1[pos] = c1[pos] + 1
    for i in range(len(w_2)):
        pos = ord(w_2[i]) - ord('a')
        c2[pos] = c2[pos] + 1
    j = 0
    OK = True
    while j < 26 and OK:
        if c1[j] == c2[j] :
            j += 1
        else:
            OK = False
    return OK
print(method2('abcd','dcbf'))