type
status
date
slug
summary
tags
category
icon
password
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 g[i], which is the minimum size of a cookie that the child will be content with; and each cookie j has a size s[j]. If s[j] >= g[i], 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.
Example 1:
  • 1 <= g.length <= 3 * 104
  • 0 <= s.length <= 3 * 104
  • 1 <= g[i], s[j] <= 231 - 1
遍历饼干并没有再起一个 for 循环,而是采用自减的方式,这也是常用的技巧
小饼干先喂饱小胃口
网站收录回溯算法专题02
Loading...