99클럽 코테 스터디 39일차 TIL Assign Cookies

# 오늘의 학습 키워드 

탐욕법(Greedy)

 

# 오늘의 문제 

https://leetcode.com/problems/assign-cookies/description/

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

 

# 나의 풀이방식 

class Solution {
    public int findContentChildren(int[] g, int[] s) {
        int result = 0;
        if(s.length == 0){
                return 0;
        }

        // 오름차순 정렬
        Arrays.sort(g);
        Arrays.sort(s);

        int i = g.length -1;
        int j = s.length -1;

        while(i >= 0 && j >= 0){

            // g배열의 값이 s배열의 값보다 작을 경우 
            if(g[i] <= s[j]){
                result++;
                i--;
                j--;
                
            }else{
                i--;
            }
        }
     
     return result;
    }
}