Python 06 Set

class Solution:def repeatedCharacter(self, s: str) -> str:st = set()for c in s:if c in st: return cst.add(c)

class Solution:def containsDuplicate(self, nums: List[int]) -> bool:d = defaultdict(int)for x in nums:if x in d:return Trued[x] += 1return Falses = set()for x in nums:if x in s:return Trues.add(x)return Falsereturn len(set(nums)) != len(nums)

class Solution:def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:# 1、双 for 超时# n = len(nums)# for i in range(n):#     for j in range(i + 1, n):#         if nums[i] == nums[j] and j - i <= k:#             return True# return False# 2、dictd = defaultdict(int)for i, x in enumerate(nums):if x in d and i - d[x] <= k: return Trued[x] = ireturn False# 3、sets, left = set(), 0# for i, x in enumerate(nums):for x in nums:if x in s: return Trues.add(x)# if len(s) > k: s.remove(nums[i - k])if len(s) > k: s.remove(nums[left])left += 1           return False

class Solution:def missingNumber(self, nums: List[int]) -> int:## 方法一：排序# n = len(nums)# nums.sort()# for i in range(n):#     if nums[i] != i:#         return i# return n## 方法二：哈希表# hash = set(nums)# for i in range(len(nums) + 1):#     if i not in hash:#         return i## 方法三：差# return sum(range(len(nums) + 1)) - sum(nums)# return (n := len(nums)) * (n + 1) // 2 - sum(nums)## 方法四：异或res = 0for i, num in enumerate(nums):res ^= i ^ numres ^= len(nums)return res

class Solution:def numUniqueEmails(self, emails: List[str]) -> int:emailSet = set()for email in emails:i = email.index('@')local = email[:i].split('+', 1)[0]  # 去掉本地名第一个加号之后的部分local = local.replace('.', '')  # 去掉本地名中所有的句点emailSet.add(local + email[i:])return len(emailSet)

class Solution:def findDifference(self, nums1: List[int], nums2: List[int]) -> List[List[int]]:a, b = set(nums1), set(nums2)return [list(a - b), list(b - a)]

class Solution:def distributeCandies(self, candyType: List[int]) -> int:n = len(candyType) // 2s = set(candyType)if len(s) >= n: return nreturn len(s)# return min(len(candyType)//2, len(set(candyType)))

class Solution:def countConsistentStrings(self, allowed: str, words: List[str]) -> int:res = 0for w in words: # 外循环# flag = True# for c in w: # 内循环#     if c not in allowed:#         flag = False#         break # 终止（内）循环# if flag: res += 1# for c in w: # 内循环#     if c not in allowed:                    #         break # 终止（内）循环# else: res += 1 # 这个是和 for 对齐的，跳过 break 终止的循环res += all(c in allowed for c in w)return resreturn sum(all(c in allowed for c in w) for w in words)return sum(set(allowed) >= set(s) for s in words)

class Solution:def applyOperations(self, nums: List[int]) -> List[int]:n, left = len(nums), 0for i in range(n):if i + 1 < n and nums[i] == nums[i + 1]:nums[i], nums[i + 1] = nums[i] * 2, 0if nums[i]:nums[i], nums[left] = nums[left], nums[i]left += 1return nums

class Solution:def maximumUnits(self, boxTypes: List[List[int]], truckSize: int) -> int:boxTypes.sort(key=lambda x:-x[1])ans = 0for a, b in boxTypes:if a >= truckSize:ans += truckSize * bbreak            ans += a * btruckSize -= a            return ans