Chapter 10 section 01 new algorithm added.

Author: liuyubobobo

10-Greedy-Algorithms/Course Code (C++)/01-Assign-Cookies/CMakeLists.txt

@@ -3,5 +3,5 @@ project(01_Assign_Cookies)
 
 set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
 
-set(SOURCE_FILES main.cpp)
+set(SOURCE_FILES main2.cpp)
 add_executable(01_Assign_Cookies ${SOURCE_FILES})

10-Greedy-Algorithms/Course Code (C++)/01-Assign-Cookies/main.cpp

@@ -6,6 +6,7 @@ using namespace std;
 
 /// 455. Assign Cookies
 /// https://leetcode.com/problems/assign-cookies/description/
+/// 先尝试满足最贪心的小朋友
 /// 时间复杂度: O(nlogn)
 /// 空间复杂度: O(1)
 class Solution {

10-Greedy-Algorithms/Course Code (C++)/01-Assign-Cookies/main2.cpp

@@ -0,0 +1,50 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+/// 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());
+        sort(s.begin(), s.end());
+
+        int gi = 0, si = 0;
+        int res = 0;
+        while(gi < g.size() && si < s.size()){
+            if(s[si] >= g[gi]){
+                res ++;
+                si ++;
+                gi ++;
+            }
+            else
+                si ++;
+        }
+
+        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;
+}

10-Greedy-Algorithms/Course Code (Java)/01-Assign-Cookies/src/Solution.java

@@ -2,9 +2,9 @@
 
 /// 455. Assign Cookies
 /// https://leetcode.com/problems/assign-cookies/description/
+/// 先尝试满足最贪心的小朋友
 /// 时间复杂度: O(nlogn)
 /// 空间复杂度: O(1)
-
 public class Solution {
 
     public int findContentChildren(int[] g, int[] s) {

10-Greedy-Algorithms/Course Code (Java)/01-Assign-Cookies/src/Solution2.java

@@ -0,0 +1,38 @@
+import java.util.Arrays;
+
+/// 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));
+    }
+}