Add C++ implementation

Signed-off-by: begeekmyfriend <begeekmyfriend@gmail.com>

Author: begeekmyfriend

0300_longest_increasing_subsequence/lis.cc

@@ -8,6 +8,7 @@ class Solution {
         vector<int> dp(nums.size(), 1);
         for (int i = 0; i < nums.size(); i++) {
             for (int j = 0; j < i; j++) {
+                // nums[i] should be contained as the last element in subsequence.
                 if (nums[j] < nums[i] && dp[j] + 1 > dp[i]) {
                     dp[i] = dp[j] + 1;
                 }

0354_russian_doll_envelopes/Makefile

@@ -0,0 +1,2 @@
+all:
+	gcc -O1 -o test russian_doll.c

0354_russian_doll_envelopes/russian_doll.c

@@ -0,0 +1,72 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+
+static int compare(const void *a, const void *b)
+{
+    int wa = ((const int *)a)[0];
+    int wb = ((const int *)b)[0];
+    int ha = ((const int *)a)[1];
+    int hb = ((const int *)b)[1];
+    return wa == wb ? hb - ha : wa - wb;
+}
+
+static int binary_search(int *nums, int lo, int hi, int target)
+{
+    while (lo + 1 < hi) {
+        int mid = lo + (hi - lo) / 2;
+        if (nums[mid] < target) {
+            lo = mid;
+        } else {
+            hi = mid;
+        }
+    }
+    return hi;
+}
+
+int maxEnvelopes(int** envelopes, int envelopesSize, int* envelopesColSize)
+{
+    if (envelopesSize == 0) {
+        return 0;
+    }
+
+    int size = envelopesColSize[0];
+    int i, *tmp = malloc(envelopesSize * size * sizeof(int));
+    for (i = 0; i < envelopesSize; i++) {
+        tmp[i * size] = envelopes[i][0];
+        tmp[i * size + 1] = envelopes[i][1];
+    }
+    qsort(tmp, envelopesSize, size * sizeof(int), compare);
+
+    int piles = 0;
+    int *heights = malloc(envelopesSize * sizeof(int));
+    for (i = 0; i < envelopesSize; i++) {
+        int pos = binary_search(heights, -1, piles, tmp[i * size + 1]);
+        if (pos == piles) {
+            piles++;
+        }
+        heights[pos] = tmp[i * size + 1];
+    }
+    return piles;
+}
+
+int main(int argc, char **argv)
+{
+    if (argc < 3 || argc % 2 == 0) {
+        fprintf(stderr, "Usage: ./test w0 h0 w1 h1...");
+        exit(-1);
+    }
+
+    int i, size = (argc - 1) / 2;
+    int *col_sizes = malloc(size * sizeof(int));
+    int **envelopes = malloc(size * sizeof(int *));
+    for (i = 0; i < size; i++) {
+        col_sizes[i] = 2;
+        envelopes[i] = malloc(col_sizes[i] * sizeof(int));
+        envelopes[i][0] = atoi(argv[i * 2 + 1]);
+        envelopes[i][1] = atoi(argv[i * 2 + 2]);
+    }
+
+    printf("%d\n", maxEnvelopes(envelopes, size, col_sizes));
+    return 0;
+}

0354_russian_doll_envelopes/russian_doll.cc

@@ -0,0 +1,39 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+class Solution {
+public:
+    int maxEnvelopes(vector<vector<int>>& envelopes) {
+        vector<int> piles;
+        sort(envelopes.begin(), envelopes.end(), compare);
+        for (const auto& e : envelopes) {
+            int pos = binary_search(piles, -1, piles.size(), e[1]);
+            if (pos == piles.size()) {
+                piles.push_back(e[1]);
+            }
+            piles[pos] = e[1];
+        }
+        return piles.size();
+    }
+private:
+    static bool compare(const vector<int>& a, const vector<int>& b) {
+        int wa = a[0];
+        int wb = b[0];
+        int ha = a[1];
+        int hb = b[1];
+        return wa == wb ? ha > hb : wa < wb;
+    }
+
+    int binary_search(vector<int>& nums, int lo, int hi, int target) {
+        while (lo + 1 < hi) {
+            int mid = lo + (hi - lo) / 2;
+            if (nums[mid] < target) {
+                lo = mid;
+            } else {
+                hi = mid;
+            }
+        }
+        return hi;
+    }
+};