leetcode243.shortest word distance

笃定1109

于 2020-06-21 23:37:08 发布

阅读量115

点赞数

文章标签： leetcode

本文链接：https://blog.csdn.net/weixin_40378100/article/details/106893372

版权

def shortestDistance(words, word1, word2):
    dist = float('inf')
    i, d1, d2 = 0, None, None
    while i<len(words):
        if words[i]==word1:
            d1=i
        elif words[i]==word2:
            d2=i
        if d1 is not None and d2 is not None:
            dist = min(dist,abs(d1-d2))
        i+=1
    return dist
words = ['hhh','lll','iii']
print(shortestDistance(words,'hhh','iii'))