Add C++ implementation

Signed-off-by: begeekmyfriend <[email protected]>

Author: begeekmyfriend

0516_longest_palindromic_subsequence/lps.c

@@ -1,5 +1,6 @@
 #include <stdio.h>
 #include <stdlib.h>
+#include <string.h>
 
 
 static inline int max(int a, int b)

1312_minimum_insertion_steps_to_make_a_string_palindrome/Makefile

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

1312_minimum_insertion_steps_to_make_a_string_palindrome/insertion.c

@@ -0,0 +1,39 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+
+static inline int min(int a, int b)
+{
+    return a < b ? a : b;
+}
+
+int minInsertions(char * s){
+    int i, j, len = strlen(s);
+    int *dp = malloc(len * sizeof(int));
+    memset(dp, 0, len * sizeof(int));
+    for (i = len - 2; i >= 0; i--) {
+        int left_down = 0;
+        for (j = i + 1; j < len; j++) {
+            int down = dp[j];
+            if (s[i] == s[j]) {
+                dp[j] = left_down;
+            } else {
+                dp[j] = min(down, dp[j - 1]) + 1;
+            }
+            left_down = down;
+        }
+    }
+    return dp[len - 1];
+}
+
+int main(int argc, char **argv)
+{
+    if (argc != 2) {
+        fprintf(stderr, "Usage: ./test s\n");
+        exit(-1);
+    }
+
+    printf("%d\n", minInsertions(argv[1]));
+    return 0;
+}

1312_minimum_insertion_steps_to_make_a_string_palindrome/insertion.cc

@@ -0,0 +1,24 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+class Solution {
+public:
+    int minInsertions(string s) {
+        int len = s.length();
+        vector<int> dp(len);
+        for (int i = len - 2; i >= 0; i--) {
+            int left_down = 0;
+            for (int j = i + 1; j < len; j++) {
+                int down = dp[j];
+                if (s[i] == s[j]) {
+                    dp[j] = left_down;
+                } else {
+                    dp[j] = min(down, dp[j - 1]) + 1;
+                }
+                left_down = down;
+            }
+        }
+        return dp[len - 1];
+    }
+};