feat: add c solution to lc problems: No.1678, 1768

YangFong · YangFong · commit c9c82047e7a7 · 2022-11-23T08:28:09.000+08:00
- No.1678.Goal Parser Interpretation
- No.1768.Merge Strings Alternately
diff --git a/solution/1600-1699/1678.Goal Parser Interpretation/README.md b/solution/1600-1699/1678.Goal Parser Interpretation/README.md
@@ -230,6 +230,31 @@ impl Solution {
 }
 ```
 
+### **C**
+
+```c
+char *interpret(char *command) {
+    int n = strlen(command);
+    char *ans = malloc(sizeof(char) * n + 1);
+    int i = 0;
+    for (int j = 0; j < n; j++) {
+        char c = command[j];
+        if (c == 'G') {
+            ans[i++] = 'G';
+        } else if (c == '(') {
+            if (command[j + 1] == ')') {
+                ans[i++] = 'o';
+            } else {
+                ans[i++] = 'a';
+                ans[i++] = 'l';
+            }
+        }
+    }
+    ans[i] = '\0';
+    return ans;
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/1600-1699/1678.Goal Parser Interpretation/README_EN.md b/solution/1600-1699/1678.Goal Parser Interpretation/README_EN.md
@@ -208,6 +208,31 @@ impl Solution {
 }
 ```
 
+### **C**
+
+```c
+char *interpret(char *command) {
+    int n = strlen(command);
+    char *ans = malloc(sizeof(char) * n + 1);
+    int i = 0;
+    for (int j = 0; j < n; j++) {
+        char c = command[j];
+        if (c == 'G') {
+            ans[i++] = 'G';
+        } else if (c == '(') {
+            if (command[j + 1] == ')') {
+                ans[i++] = 'o';
+            } else {
+                ans[i++] = 'a';
+                ans[i++] = 'l';
+            }
+        }
+    }
+    ans[i] = '\0';
+    return ans;
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/1600-1699/1678.Goal Parser Interpretation/Solution.c b/solution/1600-1699/1678.Goal Parser Interpretation/Solution.c
@@ -0,0 +1,20 @@
+char *interpret(char *command) {
+    int n = strlen(command);
+    char *ans = malloc(sizeof(char) * n + 1);
+    int i = 0;
+    for (int j = 0; j < n; j++) {
+        char c = command[j];
+        if (c == 'G') {
+            ans[i++] = 'G';
+        } else if (c == '(') {
+            if (command[j + 1] == ')') {
+                ans[i++] = 'o';
+            } else {
+                ans[i++] = 'a';
+                ans[i++] = 'l';
+            }
+        }
+    }
+    ans[i] = '\0';
+    return ans;
+}
diff --git a/solution/1700-1799/1768.Merge Strings Alternately/README.md b/solution/1700-1799/1768.Merge Strings Alternately/README.md
@@ -169,6 +169,30 @@ impl Solution {
 }
 ```
 
+### **C**
+
+```c
+char *mergeAlternately(char *word1, char *word2) {
+    int m = strlen(word1);
+    int n = strlen(word2);
+    char *ans = malloc(sizeof(char) * (n + m + 1));
+    int i = 0;
+    int j = 0;
+    while (i + j != m + n) {
+        if (i < m) {
+            ans[i + j] = word1[i];
+            i++;
+        }
+        if (j < n) {
+            ans[i + j] = word2[j];
+            j++;
+        }
+    }
+    ans[n + m] = '\0';
+    return ans;
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/1700-1799/1768.Merge Strings Alternately/README_EN.md b/solution/1700-1799/1768.Merge Strings Alternately/README_EN.md
@@ -176,6 +176,30 @@ impl Solution {
 }
 ```
 
+### **C**
+
+```c
+char *mergeAlternately(char *word1, char *word2) {
+    int m = strlen(word1);
+    int n = strlen(word2);
+    char *ans = malloc(sizeof(char) * (n + m + 1));
+    int i = 0;
+    int j = 0;
+    while (i + j != m + n) {
+        if (i < m) {
+            ans[i + j] = word1[i];
+            i++;
+        }
+        if (j < n) {
+            ans[i + j] = word2[j];
+            j++;
+        }
+    }
+    ans[n + m] = '\0';
+    return ans;
+}
+```
+
 ### **...**
 
 ```
diff --git a/solution/1700-1799/1768.Merge Strings Alternately/Solution.c b/solution/1700-1799/1768.Merge Strings Alternately/Solution.c
@@ -0,0 +1,19 @@
+char *mergeAlternately(char *word1, char *word2) {
+    int m = strlen(word1);
+    int n = strlen(word2);
+    char *ans = malloc(sizeof(char) * (n + m + 1));
+    int i = 0;
+    int j = 0;
+    while (i + j != m + n) {
+        if (i < m) {
+            ans[i + j] = word1[i];
+            i++;
+        }
+        if (j < n) {
+            ans[i + j] = word2[j];
+            j++;
+        }
+    }
+    ans[n + m] = '\0';
+    return ans;
+}
