Merge branch 'doocs:main' into main

Author: Nothing-avil

images/starcharts.svg

@@ -386,6 +386,36 @@ class Solution {
 }
 ```
 
+#### C
+
+```c
+int myAtoi(char* s) {
+    int i = 0;
+
+    while (s[i] == ' ') {
+        i++;
+    }
+
+    int sign = 1;
+    if (s[i] == '-' || s[i] == '+') {
+        sign = (s[i] == '-') ? -1 : 1;
+        i++;
+    }
+
+    int res = 0;
+    while (isdigit(s[i])) {
+        int digit = s[i] - '0';
+        if (res > INT_MAX / 10 || (res == INT_MAX / 10 && digit > INT_MAX % 10)) {
+            return sign == 1 ? INT_MAX : INT_MIN;
+        }
+        res = res * 10 + digit;
+        i++;
+    }
+
+    return res * sign;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0008.String to Integer (atoi)/README.md

@@ -374,6 +374,36 @@ class Solution {
 }
 ```
 
+#### C
+
+```c
+int myAtoi(char* s) {
+    int i = 0;
+
+    while (s[i] == ' ') {
+        i++;
+    }
+
+    int sign = 1;
+    if (s[i] == '-' || s[i] == '+') {
+        sign = (s[i] == '-') ? -1 : 1;
+        i++;
+    }
+
+    int res = 0;
+    while (isdigit(s[i])) {
+        int digit = s[i] - '0';
+        if (res > INT_MAX / 10 || (res == INT_MAX / 10 && digit > INT_MAX % 10)) {
+            return sign == 1 ? INT_MAX : INT_MIN;
+        }
+        res = res * 10 + digit;
+        i++;
+    }
+
+    return res * sign;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0008.String to Integer (atoi)/README_EN.md

@@ -0,0 +1,25 @@
+int myAtoi(char* s) {
+    int i = 0;
+
+    while (s[i] == ' ') {
+        i++;
+    }
+
+    int sign = 1;
+    if (s[i] == '-' || s[i] == '+') {
+        sign = (s[i] == '-') ? -1 : 1;
+        i++;
+    }
+
+    int res = 0;
+    while (isdigit(s[i])) {
+        int digit = s[i] - '0';
+        if (res > INT_MAX / 10 || (res == INT_MAX / 10 && digit > INT_MAX % 10)) {
+            return sign == 1 ? INT_MAX : INT_MIN;
+        }
+        res = res * 10 + digit;
+        i++;
+    }
+
+    return res * sign;
+}

solution/0000-0099/0008.String to Integer (atoi)/Solution.c

@@ -248,6 +248,24 @@ class Solution {
 }
 ```
 
+#### C
+
+```c
+bool isPalindrome(int x) {
+    if (x < 0 || (x != 0 && x % 10 == 0)) {
+        return false;
+    }
+
+    int y = 0;
+    while (y < x) {
+        y = y * 10 + x % 10;
+        x /= 10;
+    }
+
+    return (x == y || x == y / 10);
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0009.Palindrome Number/README.md

@@ -240,6 +240,24 @@ class Solution {
 }
 ```
 
+#### C
+
+```c
+bool isPalindrome(int x) {
+    if (x < 0 || (x != 0 && x % 10 == 0)) {
+        return false;
+    }
+
+    int y = 0;
+    while (y < x) {
+        y = y * 10 + x % 10;
+        x /= 10;
+    }
+
+    return (x == y || x == y / 10);
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0009.Palindrome Number/README_EN.md

@@ -0,0 +1,13 @@
+bool isPalindrome(int x) {
+    if (x < 0 || (x != 0 && x % 10 == 0)) {
+        return false;
+    }
+
+    int y = 0;
+    while (y < x) {
+        y = y * 10 + x % 10;
+        x /= 10;
+    }
+
+    return (x == y || x == y / 10);
+}

solution/0000-0099/0009.Palindrome Number/Solution.c

@@ -331,6 +331,85 @@ public class Solution {
 }
 ```
 
+#### C
+
+```c
+#define MAX_LEN 1000
+
+char *ss, *pp;
+int m, n;
+int f[MAX_LEN + 1][MAX_LEN + 1];
+
+bool dfs(int i, int j) {
+    if (j >= n) {
+        return i == m;
+    }
+    if (f[i][j] != 0) {
+        return f[i][j] == 1;
+    }
+    int res = -1;
+    if (j + 1 < n && pp[j + 1] == '*') {
+        if (dfs(i, j + 2) || (i < m && (ss[i] == pp[j] || pp[j] == '.') && dfs(i + 1, j))) {
+            res = 1;
+        }
+    } else if (i < m && (ss[i] == pp[j] || pp[j] == '.') && dfs(i + 1, j + 1)) {
+        res = 1;
+    }
+    f[i][j] = res;
+    return res == 1;
+}
+
+bool isMatch(char* s, char* p) {
+    ss = s;
+    pp = p;
+    m = strlen(s);
+    n = strlen(p);
+    memset(f, 0, sizeof(f));
+    return dfs(0, 0);
+}
+```
+
+#### PHP
+
+```php
+class Solution {
+    /**
+     * @param String $s
+     * @param String $p
+     * @return Boolean
+     */
+    function isMatch($s, $p) {
+        $m = strlen($s);
+        $n = strlen($p);
+        $f = array_fill(0, $m + 1, array_fill(0, $n + 1, 0));
+
+        $dfs = function ($i, $j) use (&$s, &$p, $m, $n, &$f, &$dfs) {
+            if ($j >= $n) {
+                return $i == $m;
+            }
+            if ($f[$i][$j] != 0) {
+                return $f[$i][$j] == 1;
+            }
+            $res = -1;
+            if ($j + 1 < $n && $p[$j + 1] == '*') {
+                if (
+                    $dfs($i, $j + 2) ||
+                    ($i < $m && ($s[$i] == $p[$j] || $p[$j] == '.') && $dfs($i + 1, $j))
+                ) {
+                    $res = 1;
+                }
+            } elseif ($i < $m && ($s[$i] == $p[$j] || $p[$j] == '.') && $dfs($i + 1, $j + 1)) {
+                $res = 1;
+            }
+            $f[$i][$j] = $res;
+            return $res == 1;
+        };
+
+        return $dfs(0, 0);
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
@@ -541,44 +620,60 @@ public class Solution {
 ```php
 class Solution {
     /**
-     * @param string $s
-     * @param string $p
-     * @return boolean
+     * @param String $s
+     * @param String $p
+     * @return Boolean
      */
-
     function isMatch($s, $p) {
         $m = strlen($s);
         $n = strlen($p);
 
-        $dp = array_fill(0, $m + 1, array_fill(0, $n + 1, false));
-        $dp[0][0] = true;
-
-        for ($j = 1; $j <= $n; $j++) {
-            if ($p[$j - 1] == '*') {
-                $dp[0][$j] = $dp[0][$j - 2];
-            }
-        }
+        $f = array_fill(0, $m + 1, array_fill(0, $n + 1, false));
+        $f[0][0] = true;
 
-        for ($i = 1; $i <= $m; $i++) {
+        for ($i = 0; $i <= $m; $i++) {
             for ($j = 1; $j <= $n; $j++) {
-                if ($p[$j - 1] == '.' || $p[$j - 1] == $s[$i - 1]) {
-                    $dp[$i][$j] = $dp[$i - 1][$j - 1];
-                } elseif ($p[$j - 1] == '*') {
-                    $dp[$i][$j] = $dp[$i][$j - 2];
-                    if ($p[$j - 2] == '.' || $p[$j - 2] == $s[$i - 1]) {
-                        $dp[$i][$j] = $dp[$i][$j] || $dp[$i - 1][$j];
+                if ($p[$j - 1] == '*') {
+                    $f[$i][$j] = $f[$i][$j - 2];
+                    if ($i > 0 && ($p[$j - 2] == '.' || $p[$j - 2] == $s[$i - 1])) {
+                        $f[$i][$j] = $f[$i][$j] || $f[$i - 1][$j];
                     }
-                } else {
-                    $dp[$i][$j] = false;
+                } elseif ($i > 0 && ($p[$j - 1] == '.' || $p[$j - 1] == $s[$i - 1])) {
+                    $f[$i][$j] = $f[$i - 1][$j - 1];
                 }
             }
         }
 
-        return $dp[$m][$n];
+        return $f[$m][$n];
     }
 }
 ```
 
+#### C
+
+```c
+bool isMatch(char* s, char* p) {
+    int m = strlen(s), n = strlen(p);
+    bool f[m + 1][n + 1];
+    memset(f, 0, sizeof(f));
+    f[0][0] = true;
+
+    for (int i = 0; i <= m; ++i) {
+        for (int j = 1; j <= n; ++j) {
+            if (p[j - 1] == '*') {
+                f[i][j] = f[i][j - 2];
+                if (i > 0 && (p[j - 2] == '.' || p[j - 2] == s[i - 1])) {
+                    f[i][j] = f[i][j] || f[i - 1][j];
+                }
+            } else if (i > 0 && (p[j - 1] == '.' || p[j - 1] == s[i - 1])) {
+                f[i][j] = f[i - 1][j - 1];
+            }
+        }
+    }
+    return f[m][n];
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->