LeetCode：1832判断句子是否为全字母句1833雪糕的最大数量

Posted 2021-05-24 南岸青栀*

文章目录

• 1832.判断句子是否为全字母句
• • 方1：使用集合去重
  • 方2:
  • 方3:
• 1833.雪糕的最大数量

1832.判断句子是否为全字母句

方法很多：主要思路就是看是否涵盖了全部字母

方1：使用集合去重

class Solution:
    def checkIfPangram(self, sentence: str) -> bool:
        set1 = set(sentence)
        lst = [0 for i in range(26)]
        for i in set1:
            lst[ord(i)-97] = 1
        if 0 in lst:
            return False
        return True

方2:

class Solution:
    def checkIfPangram(self, sentence: str) -> bool:
        dic = {}
        for i in range(26):
            dic[chr(i+97)] = 0
        for i in sentence:
            dic[i] = 1
        if 0 in dic.values():
            return False
        return True

方3:

class Solution:
    def checkIfPangram(self, sentence: str) -> bool:
        return len(set(sentence)) == 26

1833.雪糕的最大数量

【苦笑】这个题不能算中等难度吧

class Solution:
    def maxIceCream(self, costs: List[int], coins: int) -> int:
        costs.sort()
        count = 0
        for i in costs:
            if coins>=i:
                coins -= i
                count +=1
            else:
                return count
        return count