2020-06-21

Author: JiayangWu

1452.收藏清单/1452-收藏清单.py

@@ -4,24 +4,5 @@ def peopleIndexes(self, favoriteCompanies):
         :type favoriteCompanies: List[List[str]]
         :rtype: List[int]
         """
-        from collections import defaultdict
-        
-        dic = defaultdict(set)
-        
-        for i, l in enumerate(favoriteCompanies):
-            for company in l:
-                dic[company].add(i)
-
-        res = []
-        for i, l in enumerate(favoriteCompanies):
-            s = dic[l[0]]
-            for company in l[1:]:
-                # print i,s, dic[company]
-                s = s & dic[company]
-                # print s
-            # print i, s
-            if len(s) == 1:
-                res.append(i)
-                
-        return res
-        
+        s = [set(l) for l in favoriteCompanies]
+        return [i for i, s1 in enumerate(s) if not any(s1 < s2 for s2 in s)]

1455.检查单词是否为句中其他单词的前缀/1455-检查单词是否为句中其他单词的前缀.py

@@ -0,0 +1,13 @@
+class Solution(object):
+    def isPrefixOfWord(self, sentence, searchWord):
+        """
+        :type sentence: str
+        :type searchWord: str
+        :rtype: int
+        """
+        words = sentence.split()
+        for i, word in enumerate(words):
+            if word.startswith(searchWord):
+                return i + 1
+            
+        return -1

1456.定长子串中元音的最大数目/1456-定长子串中元音的最大数目.py

@@ -0,0 +1,21 @@
+class Solution(object):
+    def maxVowels(self, s, k):
+        """
+        :type s: str
+        :type k: int
+        :rtype: int
+        """
+        vowels = "aeiou"
+        
+        start = 0
+        res = 0
+        tmp = 0
+        for end in range(len(s)):
+            if s[end] in vowels:
+                tmp += 1
+            while end - start + 1 > k:
+                if s[start] in vowels:
+                    tmp -= 1
+                start += 1
+            res = max(res, tmp)
+        return res

1457.二叉树中的伪回文路径/1457-二叉树中的伪回文路径.py

@@ -0,0 +1,45 @@
+# Definition for a binary tree node.
+# class TreeNode(object):
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution(object):
+    def pseudoPalindromicPaths (self, root):
+        """
+        :type root: TreeNode
+        :rtype: int
+        """
+        self.res = 0
+        
+        def dfs(node, path):
+            if not node:
+                return
+            
+            path = path + [node.val]
+            if not node.left and not node.right:
+                if self.hasPalindromic(path):
+                    self.res += 1
+                
+            dfs(node.left, path)
+            dfs(node.right, path)
+            
+        dfs(root, [])
+        return self.res
+        
+    def hasPalindromic(self, nums):
+        from collections import Counter
+        
+        dic = Counter(nums)
+        
+        oddCnt = 0
+        for val in dic.values():
+            if val % 2:
+                oddCnt += 1
+                
+        return oddCnt <= 1
+        
+
+
+
+