题目:原题链接(中等)

标签:哈希表

解法 时间复杂度 空间复杂度 执行用时
Ans 1 (Python) O ( N × M × 26 ) O(N×M×26) O(N×M×26) O ( N ) O(N) O(N) 1392ms (7.69%)
Ans 2 (Python)
Ans 3 (Python)

解法一:

class Solution:
    def differByOne(self, dict: List[str]) -> bool:
        hashset = set(dict)

        for word in dict:
            for i in range(len(word)):
                a1 = ord(word[i]) - 97
                for a2 in range(26):
                    if a1 != a2:
                        if word[:i] + chr(a2 + 97) + word[i + 1:] in hashset:
                            return True
        return False