2020-07-20

JiayangWu · JiayangWu · commit 775ef0c85308 · 2020-07-20T22:37:30.000-04:00
diff --git a/1480.一维数组的动态和/1480-一维数组的动态和.py b/1480.一维数组的动态和/1480-一维数组的动态和.py
@@ -0,0 +1,12 @@
+class Solution(object):
+    def runningSum(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: List[int]
+        """
+        s = 0
+        res = []
+        for num in nums:
+            s += num
+            res.append(s)
+        return res
diff --git a/1481.不同整数的最少数目/1481-不同整数的最少数目.py b/1481.不同整数的最少数目/1481-不同整数的最少数目.py
@@ -0,0 +1,21 @@
+class Solution(object):
+    def findLeastNumOfUniqueInts(self, arr, k):
+        """
+        :type arr: List[int]
+        :type k: int
+        :rtype: int
+        """
+        if not arr or len(arr) == k:
+            return 0
+        from collections import Counter
+        dic = Counter(arr)
+        l = dic.values()
+        l = sorted(l)[::-1]
+        
+        target = len(arr) - k
+        s = 0
+        for i, num in enumerate(l):
+            s += num
+            if s >= target:
+                return i + 1
+        
diff --git a/1482.制作m束花所需的最少天数/1482-制作m束花所需的最少天数.py b/1482.制作m束花所需的最少天数/1482-制作m束花所需的最少天数.py
@@ -0,0 +1,32 @@
+class Solution(object):
+    def minDays(self, bloomDay, m, k):
+        """
+        :type bloomDay: List[int]
+        :type m: int
+        :type k: int
+        :rtype: int
+        """
+        if m * k > len(bloomDay):
+            return -1
+        
+        left, right = 1, max(bloomDay)
+        while left <= right:
+            mid = (left + right) // 2
+            # print mid
+            flowerCnt = 0
+            dayCnt = 0
+            for day in bloomDay:
+                if day <= mid:
+                    dayCnt += 1
+                    if dayCnt >= k:
+                        flowerCnt += 1
+                        dayCnt = 0
+                else:
+                    dayCnt = 0
+            # print flowerCnt
+            if flowerCnt >= m:
+                right = mid - 1
+            else:
+                left = mid + 1
+        return left
+                    
