Merge pull request algorithm001#701 from tolookme/master

GeekUniversity · web-flow · commit 47f249d708df · 2019-05-13T17:22:05.000+08:00
【078-week4】作业提交
diff --git a/Week_04/id_78/LeetCode_455_78.cpp b/Week_04/id_78/LeetCode_455_78.cpp
@@ -0,0 +1,23 @@
+class Solution {
+public:
+    int findContentChildren(vector<int>& g, vector<int>& s) {
+        
+        sort(g.begin(),g.end());
+        sort(s.begin(),s.end());
+        
+        int i = 0;
+        int j = 0;
+        int count = 0;
+        
+        while(i < g.size() && j < s.size()) {
+            if(g[i] <= s[j]) {
+                i++;
+                count++;
+            }
+            j++;
+        }
+        
+        return count;
+    }
+};
+
diff --git a/Week_04/id_78/LeetCode_746_78.cpp b/Week_04/id_78/LeetCode_746_78.cpp
@@ -0,0 +1,20 @@
+class Solution {
+public:
+    int minCostClimbingStairs(vector<int>& cost) {
+        int len = cost.size();
+        
+        if (len <= 2) {
+            return std::min(cost[0], cost[1]);
+        }
+        
+        int step[1001];
+        step[0] = 0;
+        step[1] = 0;
+        for(int i = 2; i <= len; i++){
+            step[i] = std::min(step[i-2] + cost[i-2], step[i-1] + cost[i-1]);
+        }
+        
+        return step[len];
+    }
+};
+
