Java——贪心算法(Leecode455/392)

class Solution {
    public int findContentChildren(int[] g, int[] s) {
    	//O(nlogn)
        Arrays.sort(g);//孩子
        Arrays.sort(s);//饼干
        int count = 0;
        int i = s.length-1;
        int j = g.length-1;
        //O(n)
        while(i>=0&&j>=0){
            if(s[i]>=g[j]){
                i--;
                j--;
                count++;
            }
            else{
                j--;
            }
        }
        return count;
    }
}

class Solution {
    public boolean isSubsequence(String s, String t) {
        int i=0,j=0;
        int count = 0;
        while(i<s.length()&&j<t.length()){
            if(s.charAt(i)==t.charAt(j)){
                i++;
                j++;
                count++;
            }
            else{
                j++;
            }
        }
        return count==s.length();
    }
}