力扣每日一题记录

1.31

题目

题解：

# 先对列表切片分出左右两块，使用set()去除重复值
class Solution:
    def distinctDifferenceArray(self, nums):
        fin = []
        for i in range(len(nums)):
            left = set(nums[:i+1])
            right = set(nums[i+1:])
            tmp = len(left) - len(right)
            fin.append(tmp)
        return fin



# 暴力解法，两重循环遍历判断重复值，慢
class Solution:
    def distinctDifferenceArray(self, nums):
        fin = []
        for i in range(len(nums)):
            tmp1 = []
            tmp2 = []
            for j in range(i+1):
                if nums[j] not in tmp1:
                    tmp1.append(nums[j])
            for k in range(len(nums)-i-1):
                if nums[k+i+1] not in tmp2:
                    tmp2.append(nums[k+i+1])
            tmp_num = len(tmp1) - len(tmp2)
            fin.append(tmp_num)
        return fin