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:

```Input: g = [1,2,3], s = [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: g = [1,2], s = [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.
```

Constraints:

• `1 <= g.length <= 3 * 104`
• `0 <= s.length <= 3 * 104`
• `1 <= g[i], s[j] <= 231 - 1`

## Rust Solution

``````struct Solution;

impl Solution {
fn find_content_children(mut g: Vec<i32>, mut s: Vec<i32>) -> i32 {
g.sort_unstable();
s.sort_unstable();
let mut i = 0;
let mut j = 0;
while i < g.len() && j < s.len() {
if g[i] <= s[j] {
i += 1;
j += 1;
} else {
while j < s.len() && s[j] < g[i] {
j += 1;
}
}
}
i as i32
}
}

#[test]
fn test() {
let g = vec![1, 2, 3];
let s = vec![1, 1];
let res = 1;
assert_eq!(Solution::find_content_children(g, s), res);
let g = vec![1, 2];
let s = vec![1, 2, 3];
let res = 2;
assert_eq!(Solution::find_content_children(g, s), res);
}
``````

Having problems with this solution? Click here to submit an issue on github.