455. Assign Cookies Easy

@problem@discussion
#Array#Greedy#Sorting



1/**
2 * [455] Assign Cookies
3 *
4 * Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie.
5 * 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.
6 *  
7 * Example 1:
8 * 
9 * Input: g = [1,2,3], s = [1,1]
10 * Output: 1
11 * Explanation: You have 3 children and 2 cookies. The greed factors of 3 children are 1, 2, 3. 
12 * 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.
13 * You need to output 1.
14 * 
15 * Example 2:
16 * 
17 * Input: g = [1,2], s = [1,2,3]
18 * Output: 2
19 * Explanation: You have 2 children and 3 cookies. The greed factors of 2 children are 1, 2. 
20 * You have 3 cookies and their sizes are big enough to gratify all of the children, 
21 * You need to output 2.
22 * 
23 *  
24 * Constraints:
25 * 
26 * 	1 <= g.length <= 3 * 10^4
27 * 	0 <= s.length <= 3 * 10^4
28 * 	1 <= g[i], s[j] <= 2^31 - 1
29 * 
30 */
31pub struct Solution {}
32
33// problem: https://leetcode.com/problems/assign-cookies/
34// discuss: https://leetcode.com/problems/assign-cookies/discuss/?currentPage=1&orderBy=most_votes&query=
35
36// submission codes start here
37
38impl Solution {
39    pub fn find_content_children(g: Vec<i32>, s: Vec<i32>) -> i32 {
40        0
41    }
42}
43
44// submission codes end
45
46#[cfg(test)]
47mod tests {
48    use super::*;
49
50    #[test]
51    fn test_455() {
52    }
53}
54


Back
© 2025 bowen.ge All Rights Reserved.