贪心算法开胃菜,一下子回到简单有点不适应了,哈哈哈哈哈哈哈
没啥好Mark的,秒了
class Solution {
public int findContentChildren(int[] g, int[] s) {
Arrays.sort(g);
Arrays.sort(s);
int i = 0;
int j = 0;
int count = 0;
while(j < s.length && i < g.length){
if(s[j] >= g[i]){
count++;
j++;
i++;
}else{
j++;
}
}
return count;
}
}