贪心算法

455. 分发饼干

https://leetcode-cn.com/problems/assign-cookies/

 

 把最大的饼干给最贪心的小朋友，如果无法满足就往前面找次贪心的小朋友

 

/// 455. Assign Cookies
/// https://leetcode.com/problems/assign-cookies/description/
/// 先尝试满足最贪心的小朋友
/// 时间复杂度: O(nlogn)
/// 空间复杂度: O(1)
public class Solution {
    public int findContentChildren(int[] g, int[] s) {
        Arrays.sort(g);
        Arrays.sort(s);
        int gi = g.length - 1, si = s.length - 1;
        int res = 0;
        while (gi >= 0 && si >= 0) {
            if (s[si] >= g[gi]) {
                res++;
                si--;
            }
            gi--;
        }
        return res;
    }
    //public static void main(String[] args) {
    //    int g1[] = {1, 2, 3};
    //    int s1[] = {1, 1};
    //    System.out.println((new Solution()).findContentChildren(g1, s1));
    //    int g2[] = {1, 2};
    //    int s2[] = {1, 2, 3};
    //    System.out.println((new Solution()).findContentChildren(g2, s2));
    //}
}

//C++
/// 455. Assign Cookies
/// https://leetcode.com/problems/assign-cookies/description/
/// 先尝试满足最贪心的小朋友
/// 时间复杂度: O(nlogn)
/// 空间复杂度: O(1)
class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        sort(g.begin(), g.end(), greater<int>());
        sort(s.begin(), s.end(), greater<int>());
        int gi = 0, si = 0;
        int res = 0;
        while(gi < g.size() && si < s.size()){
            if(s[si] >= g[gi]){
                res ++;
                si ++;
                gi ++;
            }else{
                gi ++;
            }
        }
        return res;
    }
};
//int main() {
//    int g1[] = {1, 2, 3};
//    vector<int> gv1(g1, g1 + sizeof(g1)/sizeof(int));
//    int s1[] = {1, 1};
//    vector<int> sv1(s1, s1 + sizeof(s1)/sizeof(int));
//    cout << Solution().findContentChildren(gv1, sv1) << endl;
//    int g2[] = {1, 2};
//    vector<int> gv2(g2, g2 + sizeof(g2)/sizeof(int));
//    int s2[] = {1, 2, 3};
//    vector<int> sv2(s2, s2 + sizeof(s2)/sizeof(int));
//    cout << Solution().findContentChildren(gv2, sv2) << endl;
//    return 0;
//}

 

/// 455. Assign Cookies
/// https://leetcode.com/problems/assign-cookies/description/
/// 先尝试满足最不贪心的小朋友
/// 时间复杂度: O(nlogn)
/// 空间复杂度: O(1)
public class Solution2 {
    public int findContentChildren(int[] g, int[] s) {
        Arrays.sort(g);
        Arrays.sort(s);
        int gi = 0, si = 0;
        int res = 0;
        while (gi < g.length && si < s.length) {
            if (s[si] >= g[gi]) {
                res++;
                gi++;
            }
            si++;
        }
        return res;
    }
    //public static void main(String[] args) {
    //    int g1[] = {1, 2, 3};
    //    int s1[] = {1, 1};
    //    System.out.println((new Solution2()).findContentChildren(g1, s1));
    //    int g2[] = {1, 2};
    //    int s2[] = {1, 2, 3};
    //    System.out.println((new Solution2()).findContentChildren(g2, s2));
    //}
}

---

392. 判断子序列 

https://leetcode-cn.com/problems/is-subsequence/