327python
67算法
Favoritebash
Share 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.cookie
Note: You may assume the greed factor is always positive. You cannot assign more than one cookie to one child.ui
Example 1: Input: [1,2,3], [1,1]spa
Output: 1code
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]it
Output: 2io
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.cookies
思路:貪心算法,只要s最大值知足大於g最大值,統計數據count+=1
代碼:python3
class Solution:
def findContentChildren(self, g: List[int], s: List[int]) -> int:
g.sort(reverse=True)
s.sort()
print(g)
num=0
j=len(s)-1
for index,value in enumerate(g):
if j>=0 and value<=s[j] :
num+=1
j-=1
else:
pass
return num
複製代碼