摘要： 1 class Solution: 2 def isArmstrong(self, N: int) -> bool: 3 ns = str(N) 4 lens = len(ns) 5 sums = 0 6 for n in ns: 7 cur = int(n) 8 sums ... 阅读全文

摘要： 1 import collections 2 class Solution: 3 def largestUniqueNumber(self, A: 'List[int]') -> int: 4 obj = collections.Counter(A) 5 re = -1 6 for k,v in obj.items(): 7 if v == 1 and k >re: 8 re = k 9 retu 阅读全文