fix: Update C code for compatibility with the MSVC compiler (#949)

* Replace VLA with malloc
Replace VLA with malloc to make C code
compatible with cl compiler on Windows.

* Fix C code for CI compiler.

* Fix C code compability to CI.

* check the trigger

codes/c/chapter_dynamic_programming/coin_change.c

@@ -7,7 +7,7 @@
 #include "../utils/common.h"
 
 /* 求最小值 */
-int min(int a, int b) {
+int myMin(int a, int b) {
     return a < b ? a : b;
 }
 
@@ -16,8 +16,10 @@ int coinChangeDP(int coins[], int amt, int coinsSize) {
     int n = coinsSize;
     int MAX = amt + 1;
     // 初始化 dp 表
-    int dp[n + 1][amt + 1];
-    memset(dp, 0, sizeof(dp));
+    int **dp = malloc((n + 1) * sizeof(int *));
+    for (int i = 0; i <= n; i++) {
+        dp[i] = calloc(amt + 1, sizeof(int));
+    }
     // 状态转移：首行首列
     for (int a = 1; a <= amt; a++) {
         dp[0][a] = MAX;
@@ -30,11 +32,17 @@ int coinChangeDP(int coins[], int amt, int coinsSize) {
                 dp[i][a] = dp[i - 1][a];
             } else {
                 // 不选和选硬币 i 这两种方案的较小值
-                dp[i][a] = min(dp[i - 1][a], dp[i][a - coins[i - 1]] + 1);
+                dp[i][a] = myMin(dp[i - 1][a], dp[i][a - coins[i - 1]] + 1);
             }
         }
     }
-    return dp[n][amt] != MAX ? dp[n][amt] : -1;
+    int res = dp[n][amt] != MAX ? dp[n][amt] : -1;
+    // 释放内存
+    for (int i = 0; i <= n; i++) {
+        free(dp[i]);
+    }
+    free(dp);
+    return res;
 }
 
 /* 零钱兑换：空间优化后的动态规划 */
@@ -42,8 +50,7 @@ int coinChangeDPComp(int coins[], int amt, int coinsSize) {
     int n = coinsSize;
     int MAX = amt + 1;
     // 初始化 dp 表
-    int dp[amt + 1];
-    memset(dp, MAX, sizeof(dp));
+    int *dp = calloc(amt + 1, sizeof(int));
     dp[0] = 0;
     // 状态转移
     for (int i = 1; i <= n; i++) {
@@ -53,11 +60,14 @@ int coinChangeDPComp(int coins[], int amt, int coinsSize) {
                 dp[a] = dp[a];
             } else {
                 // 不选和选硬币 i 这两种方案的较小值
-                dp[a] = min(dp[a], dp[a - coins[i - 1]] + 1);
+                dp[a] = myMin(dp[a], dp[a - coins[i - 1]] + 1);
             }
         }
     }
-    return dp[amt] != MAX ? dp[amt] : -1;
+    int res = dp[amt] != MAX ? dp[amt] : -1;
+    // 释放内存
+    free(dp);
+    return res;
 }
 
 /* Driver code */