1486.数组异或操作class Solution: def xorOperation(self, n: int, start: int) - int: nums [] for i in range(n): nums.append(start 2*i) resultnums[0] for i in range(1,n): result ^ nums[i] return result1512.好数对的数目class Solution: def numIdenticalPairs(self, nums: List[int]) - int: count0 nums_len len(nums) for i in range(nums_len): ji1 while j len(nums): if nums[i]nums[j]: count 1 j1 return count1534.统计好三元组class Solution: def countGoodTriplets(self, arr: List[int], a: int, b: int, c: int) - int: count 0 arr_lenlen(arr) for i in range(arr_len): ji1 while j arr_len: if abs(arr[i]-arr[j])a: kj1 while k arr_len: if abs(arr[j]-arr[k])b and abs(arr[i]-arr[k])c: count 1 kk1 j j1 i i1 return count