455

idf · idf · commit c9e6937ca156 · 2019-01-03T13:17:32.000-08:00
diff --git a/453 Minimum Moves to Equal Array Elements.py b/453 Minimum Moves to Equal Array Elements.py
@@ -0,0 +1,24 @@
+#!/usr/bin/python3
+"""
+Given a non-empty integer array of size n, find the minimum number of moves
+required to make all array elements equal, where a move is incrementing n - 1
+elements by 1.
+"""
+
+
+class Solution:
+    def minMoves(self, nums):
+        """
+        List out, find the pattern
+        for every operation, the max number does not change, then bring the min
+        number 1 step closer to the max.
+
+        :type nums: List[int]
+        :rtype: int
+        """
+        mini = min(nums)
+        return sum(map(lambda e: e - mini, nums))
+
+
+if __name__ == "__main__":
+    assert Solution().minMoves([1, 2, 3]) == 3
diff --git a/455 Assign Cookies.py b/455 Assign Cookies.py
@@ -0,0 +1,42 @@
+#!/usr/bin/python3
+"""
+Assume you are an awesome parent and want to give your children some cookies.
+But, you should give each child at most one cookie. Each child i has a greed
+factor gi, which is the minimum size of a cookie that the child will be content
+with; and each cookie j has a size sj. If sj >= gi, we can assign the cookie j
+to the child i, and the child i will be content. Your goal is to maximize the
+number of your content children and output the maximum number.
+
+Note:
+You may assume the greed factor is always positive.
+You cannot assign more than one cookie to one child.
+"""
+
+
+class Solution:
+    def findContentChildren(self, g, s):
+        """
+        Greedy
+
+        :type g: List[int]
+        :type s: List[int]
+        :rtype: int
+        """
+        g.sort()
+        s.sort()
+        ret = 0
+        i = 0
+        j = 0
+        while i < len(g) and j < len(s):
+            if g[i] <= s[j]:
+                ret += 1
+                i += 1
+                j += 1
+            else:
+                j += 1
+
+        return ret
+
+
+if __name__ == "__main__":
+    assert Solution().findContentChildren([10,9,8,7], [5,6,7,8]) == 2
