0012 and 0013 done in c

solution/0000-0099/0010.Regular Expression Matching/README.md

@@ -365,8 +365,7 @@ bool isMatch(char* s, char* p) {
     m = strlen(s);
     n = strlen(p);
     memset(f, 0, sizeof(f));
-    return dfs(0, 0);
-}
+    return dfs(0, 0)
 ```
 
 #### PHP

solution/0000-0099/0012.Integer to Roman/README.md

@@ -300,6 +300,29 @@ class Solution {
 }
 ```
 
+#### C
+
+```C
+
+char *intToRoman(int num) {
+  static char res[20];
+  res[0] = '\0';
+
+  int vals[] = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
+  char *syms[] = {"M",  "CM", "D",  "CD", "C",  "XC", "L",
+                  "XL", "X",  "IX", "V",  "IV", "I"};
+
+  for (int i = 0; i < 13; i++) {
+    while (num >= vals[i]) {
+      strcat(res, syms[i]);
+      num -= vals[i];
+    }
+  }
+  return res;
+}
+
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0012.Integer to Roman/README_EN.md

@@ -298,6 +298,30 @@ class Solution {
 }
 ```
 
+#### C
+
+```C
+
+char* intToRoman(int num) {
+    static char res[20];
+    res[0] = '\0';
+
+    int vals[] = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
+    char* syms[] = {"M", "CM", "D", "CD", "C", "XC", "L",
+        "XL", "X", "IX", "V", "IV", "I"};
+
+    for (int i = 0; i < 13; i++) {
+        while (num >= vals[i]) {
+            strcat(res, syms[i]);
+            num -= vals[i];
+        }
+    }
+    return res;
+}
+
+
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0012.Integer to Roman/Solution.c

@@ -0,0 +1,16 @@
+char* intToRoman(int num) {
+    static char res[20];
+    res[0] = '\0';
+
+    int vals[] = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
+    char* syms[] = {"M", "CM", "D", "CD", "C", "XC", "L",
+        "XL", "X", "IX", "V", "IV", "I"};
+
+    for (int i = 0; i < 13; i++) {
+        while (num >= vals[i]) {
+            strcat(res, syms[i]);
+            num -= vals[i];
+        }
+    }
+    return res;
+}

solution/0000-0099/0013.Roman to Integer/README.md

@@ -341,6 +341,32 @@ def roman_to_int(s)
 end
 ```
 
+#### C
+
+```C
+
+int romanToInt(char *s) {
+  int map[26] = {0};
+  map['I' - 'A'] = 1;
+  map['V' - 'A'] = 5;
+  map['X' - 'A'] = 10;
+  map['L' - 'A'] = 50;
+  map['C' - 'A'] = 100;
+  map['D' - 'A'] = 500;
+  map['M' - 'A'] = 1000;
+
+  int res = 0, i = 0;
+  while (s[i]) {
+    int val = map[s[i] - 'A'];
+    int next = s[i + 1] ? map[s[i + 1] - 'A'] : 0;
+    res += (val < next) ? -val : val;
+    i++;
+  }
+  return res;
+}
+
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0013.Roman to Integer/README_EN.md

@@ -327,6 +327,32 @@ def roman_to_int(s)
 end
 ```
 
+#### C
+
+```C
+
+int romanToInt(char *s) {
+  int map[26] = {0};
+  map['I' - 'A'] = 1;
+  map['V' - 'A'] = 5;
+  map['X' - 'A'] = 10;
+  map['L' - 'A'] = 50;
+  map['C' - 'A'] = 100;
+  map['D' - 'A'] = 500;
+  map['M' - 'A'] = 1000;
+
+  int res = 0, i = 0;
+  while (s[i]) {
+    int val = map[s[i] - 'A'];
+    int next = s[i + 1] ? map[s[i + 1] - 'A'] : 0;
+    res += (val < next) ? -val : val;
+    i++;
+  }
+  return res;
+}
+
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0013.Roman to Integer/Solution.c

@@ -0,0 +1,19 @@
+int romanToInt(char* s) {
+    int map[26] = {0};
+    map['I' - 'A'] = 1;
+    map['V' - 'A'] = 5;
+    map['X' - 'A'] = 10;
+    map['L' - 'A'] = 50;
+    map['C' - 'A'] = 100;
+    map['D' - 'A'] = 500;
+    map['M' - 'A'] = 1000;
+
+    int res = 0, i = 0;
+    while (s[i]) {
+        int val = map[s[i] - 'A'];
+        int next = s[i + 1] ? map[s[i + 1] - 'A'] : 0;
+        res += (val < next) ? -val : val;
+        i++;
+    }
+    return res;
+}