forked from rui-yan/LeetCode-1
-
Notifications
You must be signed in to change notification settings - Fork 0
/
assign-cookies.py
64 lines (59 loc) · 1.65 KB
/
assign-cookies.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
# Time: O(nlogn)
# Space: O(1)
# 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.
#
# Example 1:
# Input: [1,2,3], [1,1]
#
# Output: 1
#
# Explanation: You have 3 children and 2 cookies.
# The greed factors of 3 children are 1, 2, 3.
# And even though you have 2 cookies, since their size is both 1,
# you could only make the child whose greed factor is 1 content.
# You need to output 1.
# Example 2:
# Input: [1,2], [1,2,3]
#
# Output: 2
#
# Explanation: You have 2 children and 3 cookies.
# The greed factors of 2 children are 1, 2.
# You have 3 cookies and their sizes are big enough to gratify
# all of the children,
# You need to output 2.
try:
xrange # Python 2
except NameError:
xrange = range # Python 3
class Solution(object):
def findContentChildren(self, g, s):
"""
:type g: List[int]
:type s: List[int]
:rtype: int
"""
g.sort()
s.sort()
result, i = 0, 0
for j in xrange(len(s)):
if i == len(g):
break
if s[j] >= g[i]:
result += 1
i += 1
return result