哈希表-771-1512-1748-349-1207-139-500

最新推荐文章于 2024-11-02 22:17:47 发布

qq_45692660

最新推荐文章于 2024-11-02 22:17:47 发布

阅读量121

点赞数

分类专栏：哈希表 leecode 文章标签： python 哈希表

本文链接：https://blog.csdn.net/qq_45692660/article/details/116244138

版权

leecode 同时被 2 个专栏收录

32 篇文章 0 订阅

订阅专栏

哈希表

7 篇文章 0 订阅

订阅专栏

本文集合了Python编程的各种实践案例，包括字符串操作、数据结构、算法实现、数据处理与分析、面向对象编程和数据结构优化。深入探讨Solution类中的函数，如珠宝匹配、唯一数字查找等，适合初学者和进阶者学习。

摘要由CSDN通过智能技术生成

在这里插入图片描述

class Solution(object):
    def numJewelsInStones(self, jewels, stones):
        """
        :type jewels: str
        :type stones: str
        :rtype: int
        """
        dic={}
        for i in jewels:
            dic[i]=True
        num=0
        for i in stones:
            if dic.get(i,-1)==True:
                num+=1
        return num

在这里插入图片描述

class Solution(object):
    def numIdenticalPairs(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        dic={}
        num=0
        for i in nums:
            dic[i]=dic.get(i,0)+1
        for i in dic.values():
            num+=(i)*(i-1)/2
        return num

在这里插入图片描述

class Solution(object):
    def sumOfUnique(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        dic={}
        sum=0
        for i in nums:
            dic[i]=dic.get(i,0)+1
        keys=dic.keys()
        for i in keys:
            if dic.get(i)==1:
                sum+=i
        return sum

在这里插入图片描述

class Solution(object):
    def smallerNumbersThanCurrent(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        res=[0]*len(nums)
        count=[0]*101
        for i in nums:
            count[i]+=1
        total=0
        for i in range(len(count)):
            pre_count=total
            total+=count[i]
            count[i]=pre_count
        for i in range(len(res)):
            res[i]=count[nums[i]]
        return res

在这里插入图片描述

class Solution(object):
    def intersection(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: List[int]
        """
        dic={}
        data=[]
        for i in nums1:
            dic[i]=dic.get(i,0)+1
        for i in nums2:
            if dic.get(i,-1)!=-1:
                data.append(i)
                del dic[i]
        return data

在这里插入图片描述

class Solution(object):
    def uniqueOccurrences(self, arr):
        """
        :type arr: List[int]
        :rtype: bool
        """
        dic={}
        for i in arr:
            dic[i]=dic.get(i,0)+1
        time=dic.values()
        return len(set(time))==len(time)

在这里插入图片描述

class Solution(object):
    def singleNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        nums.sort()
        for i in range(0,len(nums)-1,2):
            if nums[i]!=nums[i+1]:
                return nums[i]
        return nums[-1]

class Solution(object):
    def singleNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        dic={}
        for i in nums:
            dic[i]=dic.get(i,0)+1
            if dic[i]==2:
                del dic[i]
        return dic.keys()[0]

在这里插入图片描述

class Solution(object):
    def findWords(self, words):
        """
        :type words: List[str]
        :rtype: List[str]
        """
        dic1={}
        dic2={}
        dic3={}
        for i in "qwertyuiop":
            dic1[i]=1
            dic1[chr(ord(i)-32)]=1
        for i in "asdfghjkl":
            dic2[i]=1
            dic2[chr(ord(i)-32)]=1
        for i in "zxcvbnm":
            dic3[i]=1
            dic3[chr(ord(i)-32)]=1
        res=[]
        for word in words:
            if dic1.get(word[0])==1:
                f=True
                for c in word[1:]:
                    if dic1.get(c)!=1:
                        f=False
                        break
                if f:
                    res.append(word)
            elif dic2.get(word[0])==1:
                f=True
                for c in word[1:]:
                    if dic2.get(c)!=1:
                        f=False
                        break
                if f:
                    res.append(word)
            else :
                f=True
                for c in word[1:]:
                    if dic3.get(c)!=1:
                        f=False
                        break
                if f:
                    res.append(word)
        return res