题目
有一群孩子和一堆饼干,每个孩子有一个饥饿度,每个饼干都有一个大小。每个孩子只能吃最多一个饼干,且只有饼干的大小大于孩子的饥饿度时,这个孩子才能吃饱。求解最多有多少孩子可以吃饱。
题解(java)
import java.util.Arrays;
public static int findContentChildren(int[] children,int [] cookies ){
int child = 0, cooki = 0;
Arrays.sort(children);
Arrays.sort(cookies);
while(child<children.length && cooki<cookies.length){
if (children[child] <= cookies[cooki]){
child++;
}
cooki++;
}
return child;
}
题解(C++)
int findContentChildren(vector<int>& children, vector<int>& cookies){
sort(children.begin(), children.end());
sort(cookies.begin(),cookies.end());
int child = 0,cookie = 0;
while(child <= children.size() && cookie <= cookies.size(){
if (children[child] <= cookies[cookie]){
child++;
}
cookie++;
return child;
}