2019-09-01

Author: JiayangWu

5173.质数排列/5173-质数排列.py

@@ -0,0 +1,25 @@
+class Solution(object):
+    def numPrimeArrangements(self, n):
+        """
+        :type n: int
+        :rtype: int
+        """
+        # 2 3 5 6 + 6
+        prime_cnt = 0
+        for i in range(1, n + 1):
+            if self.prime(i):
+                prime_cnt += 1
+        non_prime_cnt = n - prime_cnt
+        # print prime_cnt, non_prime_cnt
+        return (math.factorial(prime_cnt) * math.factorial(non_prime_cnt)) % (10 ** 9 + 7)
+        
+    def prime(self, n):
+        if n == 1:
+            return False
+        if n == 2 or n == 3 or n == 5:
+            return True
+        for i in range(2, int(n ** 0.5) + 1):
+            if n % i == 0:
+                return False
+        return True
+        

5174.健身计划评估/5174-健身计划评估.py

@@ -0,0 +1,21 @@
+class Solution(object):
+    def dietPlanPerformance(self, calories, k, lower, upper):
+        """
+        :type calories: List[int]
+        :type k: int
+        :type lower: int
+        :type upper: int
+        :rtype: int
+        """
+        res = 0
+        s = sum(calories[: k])
+        for start in range(0, len(calories) - (k - 1)):
+            if start != 0:
+                # print start, 
+                s += calories[start + k - 1] -  calories[start - 1]
+            # print s
+            if s < lower:
+                res -= 1
+            elif s > upper:
+                res += 1
+        return res

5175.构建回文串检测/5175-构建回文串检测.py

@@ -0,0 +1,39 @@
+class Solution(object):
+    def canMakePaliQueries(self, s, queries):
+        """
+        :type s: str
+        :type queries: List[List[int]]
+        :rtype: List[bool]
+        """
+        alphabet = set(s)
+        dic = dict()
+        for char in alphabet:
+            dic[char] = [0 for _ in range(len(s))]
+        
+        for i, ch in enumerate(s):
+            for char in alphabet:
+                if ch == char:
+                    if i > 0:
+                        dic[ch][i] = dic[ch][i - 1] + 1
+                    else:
+                        dic[ch][i] = 1
+                else:
+                    if i > 0:
+                        dic[char][i] = dic[char][i - 1] 
+        res = []
+        for left, right, k in queries:
+            odd_cnt = 0
+            for char in alphabet:
+                # print char, dic[char], left, right
+                if left > 0:
+                    if (dic[char][right] - dic[char][left - 1]) % 2 == 1:
+                        odd_cnt += 1
+                else:
+                    if dic[char][right] % 2 == 1:
+                        odd_cnt += 1
+            if odd_cnt // 2 <= k:
+                res.append(True)
+            else:
+                res.append(False)                
+        return res
+    

5176.猜字谜/5176-猜字谜.py

@@ -0,0 +1,27 @@
+class Solution(object):
+    def findNumOfValidWords(self, words, puzzles):
+        """
+        :type words: List[str]
+        :type puzzles: List[str]
+        :rtype: List[int]
+        """
+        from collections import Counter
+        for i in range(len(words)):
+            words[i] = "".join(sorted(set(words[i])))
+        record = Counter(words) #统计每种单词出现的频率
+        
+        res = []
+        for p in puzzles:
+            bfs = [p[0]]
+            for char in p[1:]:
+                bfs += [s + char for s in bfs]
+            cnt = 0
+            for combination in bfs:
+                tmp = "".join(sorted(combination))
+                if tmp in record:
+                    cnt += record[tmp]
+            res.append(cnt)
+        return res
+                    
+                    
+