Update Ubuntu mirror in test.yaml for dependency installation

.gitea/workflows/test.yaml

@@ -0,0 +1,36 @@
+name: Gitea CTest Workflow
+
+on:
+  push:
+    branches: [ "main", "master" ]
+  pull_request:
+
+jobs:
+  test:
+    runs-on: ubuntu-latest
+
+    steps:
+      - name: Checkout Code
+        run: |
+          git clone https://cantyonion.site/git/cantyonion/leetcode.git .
+
+      - name: Install Dependencies
+        run: |
+          sudo sed -i 's@//.*archive.ubuntu.com@//mirrors.ustc.edu.cn@g' /etc/apt/sources.list.d/ubuntu.sources
+          sudo apt-get update
+          sudo apt-get install -y build-essential cmake
+
+      - name: Configure CMake
+        # -B build 创建构建目录，-S . 指定源代码在当前目录
+        run: cmake -B build -S . -DCMAKE_BUILD_TYPE=Release
+
+      - name: Build with CMake
+        # 使用 --parallel 充分利用 Runner 核心数
+        run: cmake --build build --parallel $(nproc)
+
+      - name: Run CTest via CMake
+        # 在 build 目录下运行 ctest
+        # --output-on-failure 可以在测试失败时直接看到 log
+        run: |
+          cd build
+          ctest --output-on-failure --parallel $(nproc)

CMakeLists.txt

@@ -1,4 +1,4 @@
-cmake_minimum_required(VERSION 3.30)
+cmake_minimum_required(VERSION 3.25)
 project(leetcode C CXX)
 
 set(CMAKE_C_STANDARD 11)
@@ -18,9 +18,6 @@ include(FetchContent)
 add_compile_options(
         -Wall
         -Wextra
-        -O0
-        -g3
-        -fno-omit-frame-pointer
 )
 
 if (UNIX)

src/1137.c

@@ -4,4 +4,14 @@
 #include <solution/1137.h>
 int tribonacci(int n)
 {
+    int dp[n + 1];
+    dp[0] = 0;
+    if (n >= 1)
+        dp[1] = 1;
+    if (n >= 2)
+        dp[2] = 1;
+    for (int i = 3; i <= n; i++)
+        dp[i] = dp[i - 3] + dp[i - 2] + dp[i - 1];
+
+    return dp[n];
 }

src/1668.c

@@ -14,19 +14,20 @@ int maxRepeating(char *sequence, char *word)
         return 0;
 
     int dp[n];
+    memset(dp, 0, sizeof(dp));
     for (int i = m - 1; i < n; i++)
     {
         bool valid = true;
         for (int j = 0; j < m; j++)
         {
-            if (sequence[i - m + 1] != word[j])
+            if (sequence[i - m + 1 + j] != word[j])
             {
                 valid = false;
                 break;
             }
         }
         if (valid)
-            dp[i] = (i == m - 1 ? 0 : dp[i - m] + 1);
+            dp[i] = (i == m - 1 ? 0 : dp[i - m]) + 1;
     }
 
     int ret = dp[0];