Solution 1 - Greedy (Two Pointers)

Sort greed factors and cookies; assign the smallest cookie that satisfies the next child.

TimeComplexity: O(n \log n + m \log m)

SpaceComplexity: O(1)

""" 0455.1 - Assign Cookies - Solution 1 - Greedy (Two Pointers) """

from typing import List

class Solution:
    def findContentChildren(self, g: List[int], s: List[int]) -> int:
        g.sort()
        s.sort()
        i = j = 0

        while i < len(g) and j < len(s):
            if s[j] >= g[i]:
                i += 1
            j += 1

        return i

if __name__ == "__main__":
    print(Solution().findContentChildren([1,2,3],[1,1]))  # 1

package main

import "sort"

func findContentChildren(g []int, s []int) int {
	sort.Ints(g)
	sort.Ints(s)
	i, j := 0, 0
	for i < len(g) && j < len(s) {
		if s[j] >= g[i] {
			i++
		}
		j++
	}
	return i
}

func main() {}

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

0455 - Assign Cookies

Solution 1 - Greedy (Two Pointers)