파이썬 알고리즘 인터뷰 82번(리트코드 455번) Assign Cookies
https://leetcode.com/problems/assign-cookies/
class Solution:
def findContentChildren(self, g: List[int], s: List[int]) -> int:
g.sort()
s.sort()
result = 0
child = 0
cookie = 0
while child < len(g) and cookie < len(s):
if g[child] <= s[cookie]:
result += 1
child += 1
cookie += 1
else:
cookie += 1
return result
class Solution:
def findContentChildren(self, g: List[int], s: List[int]) -> int:
g.sort()
s.sort()
child = 0
cookie = 0
while child < len(g) and cookie < len(s):
if g[child] <= s[cookie]:
child += 1
cookie += 1
return child
result 변수 필요 없이 child가 곧 결과와 같음.class Solution:
def findContentChildren(self, g: List[int], s: List[int]) -> int:
g.sort()
s.sort()
result = 0
for i in s:
index = bisect.bisect_right(g, i)
if index > result:
result += 1
return result
bisect 모듈 사용 연습.