题目

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.

解题思路

将两个数组排序，i=0开始遍历孩子数组，找到能满足该孩子的的糖果j,找到后i++,j++,ret++，找不到则j++，直到孩子数组遍历完或者cookie数组遍历完
注意
题目中未说给的连个数组是有序的，所以需要先排序

代码

assignCookies.go

package _455_Assign_Cookies

import (
    "sort"
)

func findContentChildren(g []int, s []int) int {
    var ret int
    sort.Ints(g)
    sort.Ints(s)

    len1 := len(g)
    len2 := len(s)
    for i, j := 0, 0; i < len1 && j < len2; {
        if g[i] <= s[j] {
            i++
            j++
            ret++
        } else {
            j++
        }
    }

    return ret
}