ARTS-WEEK5

class Solutions:
    '''
    解题思路：水平扫描法
    第一个与第二个对比找到公共前缀，再与第三个对比得到公共前缀，再与第4个对比得到公共前缀，直到对比完所有数据
    '''
    def longestCommonPrefix(self, strs: List[str]) -> str:
        if not strs:
            return ""
        num = len(strs)
        prefix = strs[0]

        for i in range(1, num):
            prefix = self.lcp(prefix, strs[i])
            if not prefix:
                break

        return prefix

    def lcp(self, str1, str2):
        length, index = min(len(str1), len(str2)), 0
        while index < length and str1[index] == str2[index]:
            index += 1
        return str1[:index]

sudo chown user_name /dev/bpf*s