leetcode-第五场双周赛-1133-最大唯一数
第一次提交:
class Solution: def largestUniqueNumber(self, A: List[int]) -> int: dict = {} for i in A: if i not in dict: dict[i] = 1 else: dict[i] += 1 res = -1 for i in dict: if dict[i]==1 and i>res: res = i return res
另:
class Solution: def largestUniqueNumber(self, A: List[int]) -> int: count=collections.Counter(A) tmp=sorted(count)[::-1] for i in tmp: if count[i]==1: return i return -1