Automate of generation and formatting README file

Author: kaidul

.DS_Store

@@ -0,0 +1,45 @@
+#include <cstdio>
+#include <fstream>
+#include <string>
+#include <cstring>
+#include <cassert>
+#include <dirent.h>
+using namespace std;
+
+int main(void) {
+    freopen("../README.md", "w", stdout);
+    puts("## Solutions to LeetCode Programming Problems\n\n");
+    DIR *dir;
+    char *directoryPath = "/Users/kaidul/Documents/LeetCode_problems_solution/source-code/";
+    struct dirent *ent;
+    if ((dir = opendir (directoryPath)) != NULL) {
+        while ((ent = readdir (dir)) != NULL) {
+            int n = strlen(ent->d_name);
+            if(n < 4) {
+                continue;
+            }
+            char filename[260];
+            for(int i = 0; i < n; ++i) {
+                if(ent->d_name[i] == '_')
+                    filename[i] = ' ';
+                else filename[i] = ent->d_name[i];
+            }
+            filename[strlen(ent->d_name)] = '\0';
+            string sFileName = string(filename);
+            int dot = sFileName.find('.');
+            assert(dot != string::npos);
+            sFileName = sFileName.substr(0, dot);
+            printf("+ [%s](source-code/%s)\n", sFileName.c_str(), ent->d_name);
+            // int result = rename(ent->d_name, filename);
+            // if(result == 0) puts ( "File successfully renamed" );
+            // else perror( "Error renaming file" );
+//            printf ("%s, %s\n", ent->d_name, filename); // foo bar, foo_bar
+        }
+        closedir (dir);
+    } else {
+        /* could not open directory */
+        perror ("");
+        return EXIT_FAILURE;
+    }
+    return 0;
+}

README.md

@@ -0,0 +1,40 @@
+class Solution {
+public:
+    /*
+    int numberOfArithmeticSlices(vector<int>& arr) {
+        int n = arr.size();
+        if(n == 0) return 0;
+        vector<int> interval(n - 1);
+        for(int i = 0; i < n - 1; ++i) {
+            interval[i] = arr[i + 1] - arr[i];
+        }
+        int result = 0;
+        for(int i = 0; i < n - 1; ++i) {
+            int len = 1;
+            while(i + 1 < n - 1 and interval[i] == interval[i + 1]) {
+                ++i;
+                len++;
+            }
+            int elem = len + 1;
+            result += ((elem - 2) * (elem - 1)) / 2;
+        }
+        return result;
+    }
+    */
+    int numberOfArithmeticSlices(vector<int>& arr) {
+        int n = arr.size();
+        if(n < 3) return 0;
+        vector<int> dp(n, 0);
+        if(arr[2] - arr[1] == arr[1] - arr[0]) {
+            dp[2] = 1;
+        }
+        int result = dp[2];
+        for(int i = 3; i < n; ++i) {
+            if(arr[i] - arr[i - 1] == arr[i - 1] - arr[i - 2]) {
+                dp[i] = dp[i - 1] + 1;
+            }
+            result += dp[i];
+        }
+        return result;
+    }
+};