本文共 868 字，大约阅读时间需要 2 分钟。

题目：（中等）

标签：哈希表、二分查找

解法一：

class Solution:    def smallestCommonElement(self, mat: List[List[int]]) -> int:        size1, size2 = len(mat), len(mat[0])        hashmap = {
   i: 0 for i in range(size1)}        now = [m[0] for m in mat]        while len(set(now)) > 1:            max_val = max(now)            for i in range(size1):                idx = bisect.bisect(mat[i], max_val, lo=hashmap[i])                # print(mat[i], max_val, "->", idx - 1)                if mat[i][idx - 1] == max_val:                    hashmap[i] = idx - 1                elif idx >= size2:                    return -1                else:                    hashmap[i] = idx            now = [mat[i][hashmap[i]] for i in range(size1)]        return now[0]

转载地址：https://dataartist.blog.csdn.net/article/details/109848458 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！