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,10 +1,15 @@
-cmake_minimum_required(VERSION 3.30)
+cmake_minimum_required(VERSION 3.25)
 project(leetcode C CXX)
 
 set(CMAKE_C_STANDARD 11)
 set(CMAKE_CXX_STANDARD 17)
 set(CMAKE_EXPORT_COMPILE_COMMANDS ON)
 set(GTEST_VERSION 1.17.0)
+enable_testing()
+
+if (MSVC)
+    message(FATAL_ERROR "MSVC is not supported. Please use GCC or Clang.")
+endif ()
 
 include_directories(include)
 
@@ -13,9 +18,6 @@ include(FetchContent)
 add_compile_options(
         -Wall
         -Wextra
-        -O0
-        -g3
-        -fno-omit-frame-pointer
 )
 
 if (UNIX)
@@ -32,7 +34,7 @@ endif ()
 
 FetchContent_Declare(
         googletest
-        URL https://github.com/google/googletest/releases/download/v${GTEST_VERSION}/googletest-${GTEST_VERSION}.tar.gz
+        URL https://gh-proxy.org/https://github.com/google/googletest/releases/download/v${GTEST_VERSION}/googletest-${GTEST_VERSION}.tar.gz
 )
 
 FetchContent_MakeAvailable(googletest)
@@ -73,10 +75,10 @@ set(EXECUTABLE_SOURCES
         "${CMAKE_SOURCE_DIR}/src/3110.c"
 )
 
-foreach(src_file IN LISTS EXECUTABLE_SOURCES)
+foreach (src_file IN LISTS EXECUTABLE_SOURCES)
     get_filename_component(exe_name "${src_file}" NAME_WE)
     add_executable(${exe_name} ${src_file})
-endforeach()
+endforeach ()
 
 set(LIBRARY_SOURCES)
 

include/solution/1025.h

@@ -0,0 +1,16 @@
+// This file is generated by mkfile.py
+// Date: 2025-12-05
+
+#ifndef INC_1025_H
+#define INC_1025_H
+#include <stdbool.h>
+
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+    bool divisorGame(int n);
+#ifdef __cplusplus
+}
+#endif
+#endif // INC_1025_H

include/solution/1039.h

@@ -0,0 +1,14 @@
+// This file is generated by mkfile.py
+// Date: 2025-09-29
+
+#ifndef INC_1039_H
+#define INC_1039_H
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+    int minScoreTriangulation(int *values, int valuesSize);
+#ifdef __cplusplus
+}
+#endif
+#endif // INC_1039_H

include/solution/1137.h

@@ -0,0 +1,14 @@
+// This file is generated by mkfile.py
+// Date: 2025-12-05
+
+#ifndef INC_1137_H
+#define INC_1137_H
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+    int tribonacci(int n);
+#ifdef __cplusplus
+}
+#endif
+#endif // INC_1137_H

include/solution/1233.h

@@ -0,0 +1,11 @@
+#ifndef INC_1233_H
+#define INC_1233_H
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+    char **removeSubfolders(char **folder, int folderSize, int *returnSize);
+#ifdef __cplusplus
+}
+#endif
+#endif

include/solution/1668.h

@@ -0,0 +1,14 @@
+// This file is generated by mkfile.py
+// Date: 2025-12-05
+
+#ifndef INC_1668_H
+#define INC_1668_H
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+    int maxRepeating(char *sequence, char *word);
+#ifdef __cplusplus
+}
+#endif
+#endif // INC_1668_H

include/solution/1717.h

@@ -0,0 +1,11 @@
+#ifndef INC_1717_H
+#define INC_1717_H
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+    int maximumGain(char *s, int x, int y);
+#ifdef __cplusplus
+}
+#endif
+#endif

include/solution/1957.h

@@ -0,0 +1,11 @@
+#ifndef INC_1957_H
+#define INC_1957_H
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+    char *makeFancyString(char *s);
+#ifdef __cplusplus
+}
+#endif
+#endif

include/solution/3397.h

@@ -0,0 +1,14 @@
+// This file is generated by mkfile.py
+// Date: 2025-10-18
+
+#ifndef INC_3397_H
+#define INC_3397_H
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+    int maxDistinctElements(int* nums, int numsSize, int k);
+#ifdef __cplusplus
+}
+#endif
+#endif // INC_3397_H

include/solution/345.h

@@ -0,0 +1,11 @@
+#ifndef INC_345_H
+#define INC_345_H
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+    char *reverseVowels(char *s);
+#ifdef __cplusplus
+}
+#endif
+#endif

include/solution/387.h

@@ -0,0 +1,11 @@
+#ifndef INC_387_H
+#define INC_387_H
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+    int firstUniqChar(char *s);
+#ifdef __cplusplus
+}
+#endif
+#endif

include/solution/392.h

@@ -0,0 +1,12 @@
+#ifndef INC_392_H
+#define INC_392_H
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+#include <stdbool.h>
+    bool isSubsequence(char *s, char *t);
+#ifdef __cplusplus
+}
+#endif
+#endif

include/solution/509.h

@@ -0,0 +1,14 @@
+// This file is generated by mkfile.py
+// Date: 2025-12-05
+
+#ifndef INC_509_H
+#define INC_509_H
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+    int fib(int n);
+#ifdef __cplusplus
+}
+#endif
+#endif // INC_509_H

include/solution/746.h

@@ -0,0 +1,14 @@
+// This file is generated by mkfile.py
+// Date: 2025-12-05
+
+#ifndef INC_746_H
+#define INC_746_H
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+    int minCostClimbingStairs(int *cost, int costSize);
+#ifdef __cplusplus
+}
+#endif
+#endif // INC_746_H

include/solution/976.h

@@ -0,0 +1,11 @@
+#ifndef INC_976_H
+#define INC_976_H
+#ifdef __cplusplus
+extern "C"
+{
+#endif
+int largestPerimeter(int* nums, int numsSize);
+#ifdef __cplusplus
+}
+#endif
+#endif

mkfile.bat

@@ -1,49 +0,0 @@
-@echo off
-chcp 65001
-setlocal enabledelayedexpansion
-
-:: 检查参数是否存在
-if "%~1"=="" (
-    echo 用法: %~nx0 文件名（不带扩展名）
-    exit /b 1
-)
-
-set "NAME=%~1"
-set "NAME_UPPER=%NAME:_=_%"
-set "NAME_UPPER=%NAME_UPPER:"=%"
-for %%A in (%NAME_UPPER%) do (
-    set "NAME_UPPER=!NAME_UPPER:%%A=%%~A!"
-)
-set "NAME_UPPER=!NAME_UPPER:.=_!"
-
-:: 创建目录结构
-mkdir include\solution 2>nul
-mkdir src 2>nul
-mkdir tests 2>nul
-
-:: 生成 include/solution/a.h
-(
-echo #ifndef INC_!NAME_UPPER!_H
-echo #define INC_!NAME_UPPER!_H
-echo #ifdef __cplusplus
-echo extern "C" {
-echo #endif
-echo.
-echo #ifdef __cplusplus
-echo }
-echo #endif
-echo #endif
-) > include\solution\%NAME%.h
-
-:: 生成 src/a.c
-(
-echo #include ^<solution/%NAME%.h^>
-) > src\%NAME%.c
-
-:: 生成 tests/test_a.cpp
-(
-echo #include ^<gtest/gtest.h^>
-echo #include ^<solution/%NAME%.h^>
-) > tests\test_%NAME%.cpp
-
-echo 文件创建完成。

mkfile.py

@@ -0,0 +1,41 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+import sys
+import datetime
+
+if len(sys.argv) != 2:
+    print("Usage: mkfile.py <filename>")
+    sys.exit(1)
+
+filename = sys.argv[1]
+
+# create header file
+with open(f"./include/solution/{filename.lower()}.h", "w") as f:
+    f.write("// This file is generated by mkfile.py\n")
+    f.write(f"// Date: {datetime.datetime.now().strftime('%Y-%m-%d')}\n\n")
+    f.write(f"#ifndef INC_{filename.upper()}_H\n")
+    f.write(f"#define INC_{filename.upper()}_H\n")
+    f.write("#ifdef __cplusplus\n")
+    f.write("extern \"C\"\n")
+    f.write("{\n")
+    f.write("#endif\n\n")
+    f.write("#ifdef __cplusplus\n")
+    f.write("}\n")
+    f.write("#endif\n")
+    f.write(f"#endif // INC_{filename.upper()}_H\n")
+    f.close()
+
+# create source file
+with open(f"./src/{filename.lower()}.c", "w") as f:
+    f.write("// This file is generated by mkfile.py\n")
+    f.write(f"// Date: {datetime.datetime.now().strftime('%Y-%m-%d')}\n\n")
+    f.write(f'#include <solution/{filename.lower()}.h>\n')
+    f.close()
+
+# create test file
+with open(f"./tests/test_{filename.lower()}.cpp", "w") as f:
+    f.write("// This file is generated by mkfile.py\n")
+    f.write(f"// Date: {datetime.datetime.now().strftime('%Y-%m-%d')}\n\n")
+    f.write(f'#include <solution/{filename.lower()}.h>\n')
+    f.write("#include <gtest/gtest.h>\n")
+    f.close()

mkfile.sh

@@ -1,39 +0,0 @@
-#!/bin/bash
-
-# 检查参数
-if [ $# -ne 1 ]; then
-    echo "用法: $0 <文件名（不带扩展名）>"
-    exit 1
-fi
-
-filename="$1"
-upper_filename=$(echo "$filename" | tr '[:lower:]' '[:upper:]')
-
-# 创建目录（如果不存在）
-mkdir -p ./include/solution ./src ./tests
-
-# 创建 ./include/solution/a.h
-cat > ./include/solution/"$filename".h <<EOF
-#ifndef INC_${upper_filename}_H
-#define INC_${upper_filename}_H
-#ifdef __cplusplus
-extern "C"
-{
-#endif
-
-#ifdef __cplusplus
-}
-#endif
-#endif
-EOF
-
-# 创建 ./src/a.c
-cat > ./src/"$filename".c <<EOF
-#include <solution/$filename.h>
-EOF
-
-# 创建 ./tests/test_a.cpp
-cat > ./tests/test_"$filename".cpp <<EOF
-#include <gtest/gtest.h>
-#include <solution/$filename.h>
-EOF

src/1025.c

@@ -0,0 +1,7 @@
+// This file is generated by mkfile.py
+// Date: 2025-12-05
+#include <solution/1025.h>
+bool divisorGame(int n)
+{
+    return n % 2 == 0;
+}

src/1039.c

@@ -0,0 +1,30 @@
+// This file is generated by mkfile.py
+// Date: 2025-09-29
+
+#include <limits.h>
+#include <solution/1039.h>
+
+#define min(x, y) (x) < (y) ? (x) : (y)
+
+int minScoreTriangulation(int *values, int valuesSize)
+{
+    int dp[valuesSize][valuesSize];
+    for (int i = 0; i < valuesSize; i++)
+        for (int j = 0; j < valuesSize; j++)
+            dp[i][j] = 0;
+
+    for (int len = 2; len < valuesSize; len++)
+    {
+        for (int i = 0; i + len < valuesSize; i++)
+        {
+            int j = i + len;
+            dp[i][j] = INT_MAX;
+
+            for (int k = i + 1; k < j; k++)
+            {
+                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j] + values[i] * values[j] * values[k]);
+            }
+        }
+    }
+    return dp[0][valuesSize - 1];
+}

src/1137.c

@@ -0,0 +1,17 @@
+// This file is generated by mkfile.py
+// Date: 2025-12-05
+
+#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/1233.c

@@ -0,0 +1,30 @@
+#include <solution/1233.h>
+#include <stdbool.h>
+#include <stdlib.h>
+
+bool startwith(char *p, char *s)
+{
+    for (; *p && *s; p++, s++)
+        if (*p != *s)
+            return false;
+
+    return (!*p && *s) || (!*p && !*s);
+}
+
+char **removeSubfolders(char **folder, int folderSize, int *returnSize)
+{
+    char **ret = malloc(sizeof(char *));
+    *returnSize = 1;
+
+    ret[0] = folder[0];
+    for (int i = 1; i < folderSize; i++)
+    {
+        if (startwith(ret[*(returnSize)-1], folder[i]))
+            continue;
+
+        ret = realloc(ret, sizeof(char *) * ++(*returnSize));
+        ret[*returnSize - 1] = folder[i];
+    }
+
+    return ret;
+}

src/1668.c

@@ -0,0 +1,38 @@
+// This file is generated by mkfile.py
+// Date: 2025-12-05
+
+#include <solution/1668.h>
+#include <stdbool.h>
+#include <string.h>
+
+#define max(x, y) ((x) > (y) ? (x) : (y))
+
+int maxRepeating(char *sequence, char *word)
+{
+    int n = strlen(sequence), m = strlen(word);
+    if (n < m)
+        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 + j] != word[j])
+            {
+                valid = false;
+                break;
+            }
+        }
+        if (valid)
+            dp[i] = (i == m - 1 ? 0 : dp[i - m]) + 1;
+    }
+
+    int ret = dp[0];
+    for (int i = 1; i < n; i++)
+        ret = max(ret, dp[i]);
+
+    return ret;
+}

src/1717.c

@@ -0,0 +1,91 @@
+#include <solution/1717.h>
+#include <stdint.h>
+#include <stdlib.h>
+#include <string.h>
+
+typedef struct
+{
+    char *base;
+    size_t size;
+    size_t top;
+} stack_t;
+
+void init_stack(stack_t *s)
+{
+    s->base = malloc(sizeof(char) * 10);
+    s->size = 10;
+    s->top = 0;
+}
+
+void push(stack_t *s, char c)
+{
+    if (s->top + 1 >= s->size)
+    {
+        s->size += 10;
+        s->base = realloc(s->base, sizeof(char) * s->size);
+    }
+    s->base[++(s->top)] = c;
+}
+
+char pop(stack_t *s)
+{
+    if (s->top == 0)
+        return '\0';
+    return s->base[(s->top)--];
+}
+
+void clear(stack_t *s)
+{
+    s->top = 0;
+}
+
+char top(stack_t *s)
+{
+    return s->base[s->top];
+}
+
+char *sts(stack_t *s)
+{
+    char *ret = malloc(sizeof(char) * (s->top + 1));
+
+    memcpy(ret, s->base + 1, s->top);
+    ret[s->top] = '\0';
+
+    return ret;
+}
+
+void delete_stack(stack_t *s)
+{
+    free(s->base);
+}
+
+char *del(char *s, char m1, char m2, int *score, int v)
+{
+    stack_t st;
+    init_stack(&st);
+    while (*s)
+    {
+        if (top(&st) == m1 && *s == m2)
+        {
+            s += 1, *score += v;
+            pop(&st);
+        }
+        else
+            push(&st, *(s++));
+    }
+
+    char *r = sts(&st);
+    delete_stack(&st);
+    return r;
+}
+
+int maximumGain(char *s, int x, int y)
+{
+    int score = 0;
+    if (x > y)
+        del(del(s, 'a', 'b', &score, x), 'b', 'a', &score, y);
+    else
+        del(del(s, 'b', 'a', &score, y), 'a', 'b', &score, x);
+
+    return score;
+}

src/1957.c

@@ -0,0 +1,13 @@
+#include <solution/1957.h>
+#include <string.h>
+
+char *makeFancyString(char *s)
+{
+    int d[26] = {0};
+    int len = strlen(s);
+    for (int i = len - 1; i >= 0; i--)
+        if (++(d[s[i] - 'a']) > 3)
+            for (int j = i; j < len - 1; j++)
+                s[j] = s[j + 1];
+    return s;
+}

src/338.c

@@ -1,13 +1,44 @@
 //
 // Created by aurora on 2024/9/16.
 //
+#include <assert.h>
 #include <solution/338.h>
+#include <stdlib.h>
+
+#define ASSERT(x, expect)                                                                                              \
+    do                                                                                                                 \
+    {                                                                                                                  \
+        int retSize;                                                                                                   \
+        int *ret;                                                                                                      \
+        ret = countBits(x, &retSize);                                                                                  \
+        for (int i = 0; i < retSize; i++)                                                                              \
+            assert(ret[i] == expect[i]);                                                                               \
+        free(ret);                                                                                                     \
+    } while (0)
+
 int *countBits(int n, int *returnSize)
 {
-    return 0;
+    *returnSize = n + 1;
+    int *ret = (int *)malloc(sizeof(int) * (*returnSize));
+    ret[0] = 0;
+    for (int i = 1; i <= n; i++)
+    {
+        ret[i] = ret[i >> 1] + (i & 1);
+        // equal to the following expression
+        // if (i % 2 == 0)
+        //     ret[i] = ret[i / 2];
+        // else
+        //     ret[i] = ret[i - 1] + 1;
+    }
+
+    return ret;
 }
 
-int main() {
+int main()
-
+{
+    int t1[] = {0, 1, 1};
+    ASSERT(2, t1);
+    int t2[] = {0, 1, 1, 2, 1, 2};
+    ASSERT(5, t2);
     return 0;
 }

src/3397.c

@@ -0,0 +1,41 @@
+// This file is generated by mkfile.py
+// Date: 2025-10-18
+
+#include <solution/3397.h>
+#include <stdlib.h>
+int cmp(const void *a, const void *b)
+{
+    return *(int *)a - *(int *)b;
+}
+
+int maxDistinctElements(int *nums, int numsSize, int k)
+{
+    if (numsSize == 0)
+        return 0;
+
+    qsort(nums, numsSize, sizeof(int), cmp);
+    int result = 1;
+    int prev = nums[0] - k;
+
+    for (int i = 1; i < numsSize; i++)
+    {
+        int min = nums[i] - k;
+        int max = nums[i] + k;
+
+        if (prev >= min)
+        {
+            if (max <= prev)
+            {
+                continue;
+            }
+            prev += 1;
+        }
+        else
+        {
+            prev = min;
+        }
+        result++;
+    }
+
+    return result;
+}

src/345.c

@@ -0,0 +1,32 @@
+#include <solution/345.h>
+#include <string.h>
+
+#define equal(x)                                                                                                       \
+    ((x) == 'a' || (x) == 'A' || (x) == 'e' || (x) == 'E' || (x) == 'i' || (x) == 'I' || (x) == 'o' || (x) == 'O' ||   \
+     (x) == 'u' || (x) == 'U')
+
+#define swap(x, y, cb)                                                                                                 \
+    do                                                                                                                 \
+    {                                                                                                                  \
+        char t = x;                                                                                                    \
+        x = y;                                                                                                         \
+        y = t;                                                                                                         \
+        cb;                                                                                                            \
+    } while (0)
+
+char *reverseVowels(char *s)
+{
+    for (int i = 0, j = strlen(s) - 1, f = 1; i < j;)
+    {
+        if (f && equal(s[i]))
+            f = 0;
+        else if (f)
+            i++;
+        else if (!f && equal(s[j]))
+            swap(s[i], s[j], (f = 1, i++, j--));
+        else
+            j--;
+    }
+
+    return s;
+}

src/387.c

@@ -0,0 +1,17 @@
+#include <solution/387.h>
+#include <string.h>
+
+int firstUniqChar(char *s)
+{
+    int hash[26];
+    memset(hash, 0, sizeof(int) * 26);
+
+    for (int idx = 0; s[idx]; idx++)
+        hash[s[idx] - 'a']++;
+
+    for (int idx = 0; s[idx]; idx++)
+        if (hash[s[idx] - 'a'] == 1)
+            return idx;
+
+    return -1;
+}

src/392.c

@@ -0,0 +1,10 @@
+#include <solution/392.h>
+
+bool isSubsequence(char *s, char *t)
+{
+    for (; *s && *t; t++)
+        if (*s == *t)
+            s++;
+
+    return !*s;
+}

src/509.c

@@ -0,0 +1,14 @@
+// This file is generated by mkfile.py
+// Date: 2025-12-05
+
+#include <solution/509.h>
+int fib(int n)
+{
+    int dp[n + 1];
+    dp[0] = 0;
+    if (n >= 1)
+        dp[1] = 1;
+    for (int i = 2; i <= n; i++)
+        dp[i] = dp[i - 1] + dp[i - 2];
+    return dp[n];
+}

src/746.c

@@ -0,0 +1,15 @@
+// This file is generated by mkfile.py
+// Date: 2025-12-05
+
+#include <solution/746.h>
+
+#define min(x, y) ((x) < (y) ? (x) : (y))
+int minCostClimbingStairs(int *cost, int costSize)
+{
+    int dp[costSize + 1];
+    dp[0] = dp[1] = 0;
+    for (int i = 2; i <= costSize; i++)
+        dp[i] = min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
+
+    return dp[costSize];
+}

src/976.c

@@ -0,0 +1,27 @@
+#include <solution/976.h>
+#include <stdlib.h>
+
+int cmp(const void *a, const void *b)
+{
+    return *(const int *)b - *(const int *)a;
+}
+
+int largestPerimeter(int *nums, int numsSize)
+{
+    qsort(nums, numsSize, sizeof(int), cmp);
+    int i = 0, j = 1;
+
+    while (i < numsSize - 2 && j < numsSize - 1)
+    {
+        int k = j + 1;
+        if (nums[i] < nums[j] + nums[k])
+            return nums[i] + nums[j] + nums[k];
+        else
+        {
+            j++;
+            i++;
+        }
+    }
+
+    return 0;
+}

tests/CMakeLists.txt

@@ -10,5 +10,3 @@ foreach (TEST_SRC ${TEST_SOURCES})
 
     add_test(NAME ${TEST_NAME} COMMAND ${TEST_NAME})
 endforeach ()
-
-enable_testing()

tests/test_1025.cpp

@@ -0,0 +1,45 @@
+// This file is generated by mkfile.py
+// Date: 2025-12-05
+
+#include <gtest/gtest.h>
+#include <solution/1025.h>
+
+// Tests for divisorGame (LeetCode 1025)
+class DivisorGameTest : public ::testing::Test
+{
+  protected:
+    void AssertDivisorGame(int n, bool expected)
+    {
+        ASSERT_EQ(divisorGame(n), expected);
+    }
+};
+
+TEST_F(DivisorGameTest, One)
+{
+    AssertDivisorGame(1, false);
+}
+
+TEST_F(DivisorGameTest, Two)
+{
+    AssertDivisorGame(2, true);
+}
+
+TEST_F(DivisorGameTest, Three)
+{
+    AssertDivisorGame(3, false);
+}
+
+TEST_F(DivisorGameTest, Four)
+{
+    AssertDivisorGame(4, true);
+}
+
+TEST_F(DivisorGameTest, LargeEven)
+{
+    AssertDivisorGame(100, true);
+}
+
+TEST_F(DivisorGameTest, LargeOdd)
+{
+    AssertDivisorGame(101, false);
+}

tests/test_1039.cpp

@@ -0,0 +1,45 @@
+// This file is generated by mkfile.py
+// Date: 2025-09-29
+
+#include <gtest/gtest.h>
+#include <solution/1039.h>
+
+
+class MinScoreTriangulationTest : public ::testing::Test
+{
+  protected:
+    void AssertMinScoreTriangulation(std::vector<int> input, int expected)
+    {
+        int *values = new int[input.size()];
+        std::copy(input.begin(), input.end(), values);
+
+        int result = minScoreTriangulation(values, input.size());
+        ASSERT_EQ(result, expected);
+
+        delete[] values;
+    }
+};
+
+// 示例 1
+TEST_F(MinScoreTriangulationTest, Example1)
+{
+    // 输入: values = [1,2,3]
+    // 输出: 6
+    AssertMinScoreTriangulation({1, 2, 3}, 6);
+}
+
+// 示例 2
+TEST_F(MinScoreTriangulationTest, Example2)
+{
+    // 输入: values = [3,7,4,5]
+    // 输出: 144
+    AssertMinScoreTriangulation({3, 7, 4, 5}, 144);
+}
+
+// 示例 3
+TEST_F(MinScoreTriangulationTest, Example3)
+{
+    // 输入: values = [1,3,1,4,1,5]
+    // 输出: 13
+    AssertMinScoreTriangulation({1, 3, 1, 4, 1, 5}, 13);
+}

tests/test_1137.cpp

@@ -0,0 +1,41 @@
+// This file is generated by mkfile.py
+// Date: 2025-12-05
+
+#include <gtest/gtest.h>
+#include <solution/1137.h>
+
+// Tests for tribonacci (LeetCode 1137)
+class TribonacciTest : public ::testing::Test
+{
+  protected:
+    void AssertTribo(int n, int expected)
+    {
+        ASSERT_EQ(tribonacci(n), expected);
+    }
+};
+
+TEST_F(TribonacciTest, BaseCases)
+{
+    AssertTribo(0, 0);
+    AssertTribo(1, 1);
+    AssertTribo(2, 1);
+}
+
+TEST_F(TribonacciTest, SmallNumbers)
+{
+    AssertTribo(3, 2);
+    AssertTribo(4, 4);
+    AssertTribo(5, 7);
+}
+
+TEST_F(TribonacciTest, MediumNumbers)
+{
+    AssertTribo(10, 149);
+    AssertTribo(15, 3136);
+}
+
+TEST_F(TribonacciTest, UpperBound)
+{
+    AssertTribo(25, 1389537);
+    AssertTribo(37, 2082876103);
+}

tests/test_1233.cpp

@@ -0,0 +1,52 @@
+#include <algorithm>
+#include <gtest/gtest.h>
+#include <solution/1233.h>
+#include <string>
+#include <vector>
+
+bool ArrayEquals(char **actual, int actualSize, const std::vector<std::string> &expected)
+{
+    if (actualSize != expected.size())
+        return false;
+
+    std::vector<std::string> actualVec(actual, actual + actualSize);
+    return std::is_permutation(actualVec.begin(), actualVec.end(), expected.begin());
+}
+
+// 测试类
+class RemoveSubfoldersTest : public ::testing::Test
+{
+  protected:
+    void AssertFolders(std::vector<std::string> input, std::vector<std::string> expected)
+    {
+        int returnSize = 0;
+        std::vector<char *> c_input;
+        for (auto &s : input)
+            c_input.push_back(const_cast<char *>(s.c_str()));
+
+        char **result = removeSubfolders(c_input.data(), (int)c_input.size(), &returnSize);
+        ASSERT_TRUE(ArrayEquals(result, returnSize, expected));
+
+        // 可选释放 result 内存，如果实现中是动态分配的（free）
+        // 例如：for (int i = 0; i < returnSize; ++i) free(result[i]);
+        // free(result);
+    }
+};
+
+// 示例 1
+TEST_F(RemoveSubfoldersTest, Example1)
+{
+    AssertFolders({"/a", "/a/b", "/c/d", "/c/d/e", "/c/f"}, {"/a", "/c/d", "/c/f"});
+}
+
+// 示例 2
+TEST_F(RemoveSubfoldersTest, Example2)
+{
+    AssertFolders({"/a", "/a/b/c", "/a/b/d"}, {"/a"});
+}
+
+// 示例 3
+TEST_F(RemoveSubfoldersTest, Example3)
+{
+    AssertFolders({"/a/b/c", "/a/b/ca", "/a/b/d"}, {"/a/b/c", "/a/b/ca", "/a/b/d"});
+}

tests/test_1668.cpp

@@ -0,0 +1,49 @@
+// This file is generated by mkfile.py
+// Date: 2025-12-05
+
+#include <gtest/gtest.h>
+#include <solution/1668.h>
+
+#include <string>
+
+// Tests for maxRepeating (LeetCode 1668)
+class MaxRepeatingTest : public ::testing::Test
+{
+  protected:
+    void AssertMaxRepeating(const std::string &sequence, const std::string &word, int expected)
+    {
+        int result = maxRepeating(const_cast<char *>(sequence.c_str()), const_cast<char *>(word.c_str()));
+        ASSERT_EQ(result, expected);
+    }
+};
+
+TEST_F(MaxRepeatingTest, Example1)
+{
+    AssertMaxRepeating("ababc", "ab", 2);
+}
+
+TEST_F(MaxRepeatingTest, Example2)
+{
+    AssertMaxRepeating("ababc", "ba", 1);
+}
+
+TEST_F(MaxRepeatingTest, RepeatedMany)
+{
+    AssertMaxRepeating("abababab", "ab", 4);
+}
+
+TEST_F(MaxRepeatingTest, OverlappingNotAllowed)
+{
+    // word = "aa", repeated twice is "aaaa" which appears, so answer 2
+    AssertMaxRepeating("aaaaa", "aa", 2);
+}
+
+TEST_F(MaxRepeatingTest, ShorterThanWord)
+{
+    AssertMaxRepeating("a", "aa", 0);
+}
+
+TEST_F(MaxRepeatingTest, SingleCharWord)
+{
+    AssertMaxRepeating("aaaa", "a", 4);
+}

tests/test_1717.cpp

@@ -0,0 +1,30 @@
+#include <gtest/gtest.h>
+#include <solution/1717.h>
+
+class MaximumGainTest : public ::testing::Test
+{
+  protected:
+    void AssertMaximumGain(const std::string &input, int x, int y, int expected)
+    {
+        char *s = strdup(input.c_str()); // 复制字符串，防止修改原始数据
+        int result = maximumGain(s, x, y);
+        ASSERT_EQ(result, expected);
+        free(s);
+    }
+};
+
+// 示例 1
+TEST_F(MaximumGainTest, Example1)
+{
+    // 输入：s = "cdbcbbaaabab", x = 4, y = 5
+    // 输出：19
+    AssertMaximumGain("cdbcbbaaabab", 4, 5, 19);
+}
+
+// 示例 2
+TEST_F(MaximumGainTest, Example2)
+{
+    // 输入：s = "aabbaaxybbaabb", x = 5, y = 4
+    // 输出：20
+    AssertMaximumGain("aabbaaxybbaabb", 5, 4, 20);
+}

tests/test_1957.cpp

@@ -0,0 +1,37 @@
+#include <gtest/gtest.h>
+#include <solution/1957.h>
+#include <string>
+
+class MakeFancyStringTest : public ::testing::Test
+{
+  protected:
+    void AssertFancyString(const std::string &input, const std::string &expected)
+    {
+        char *c_input = strdup(input.c_str()); // 复制一份以防原始修改
+        char *result = makeFancyString(c_input);
+
+        ASSERT_STREQ(result, expected.c_str());
+
+        // 如函数返回的是 malloc 分配的，则应释放
+        // free(result);
+        free(c_input);
+    }
+};
+
+// 示例 1：leeetcode → leetcode
+TEST_F(MakeFancyStringTest, Example1)
+{
+    AssertFancyString("leeetcode", "leetcode");
+}
+
+// 示例 2：aaabaaaa → aabaa
+TEST_F(MakeFancyStringTest, Example2)
+{
+    AssertFancyString("aaabaaaa", "aabaa");
+}
+
+// 示例 3：aab → aab
+TEST_F(MakeFancyStringTest, Example3)
+{
+    AssertFancyString("aab", "aab");
+}

tests/test_3397.cpp

@@ -0,0 +1,32 @@
+// This file is generated by mkfile.py
+// Date: 2025-10-18
+
+#include <solution/3397.h>
+#include <gtest/gtest.h>
+
+class MaxDistinctElementsTest : public ::testing::Test {
+protected:
+    void AssertMaxDistinctElements(std::vector<int> nums, int k, int expected) {
+        int* arr = new int[nums.size()];
+        std::copy(nums.begin(), nums.end(), arr);
+
+        int result = maxDistinctElements(arr, nums.size(), k);
+        ASSERT_EQ(result, expected);
+
+        delete[] arr;
+    }
+};
+
+// 示例 1
+TEST_F(MaxDistinctElementsTest, Example1) {
+    // 输入：nums = [1,2,2,3,3,4], k = 2
+    // 输出：6
+    AssertMaxDistinctElements({1, 2, 2, 3, 3, 4}, 2, 6);
+}
+
+// 示例 2
+TEST_F(MaxDistinctElementsTest, Example2) {
+    // 输入：nums = [4,4,4,4], k = 1
+    // 输出：3
+    AssertMaxDistinctElements({4, 4, 4, 4}, 1, 3);
+}

tests/test_345.cpp

@@ -0,0 +1,29 @@
+#include <gtest/gtest.h>
+#include <solution/345.h>
+
+class ReverseVowelsTest : public ::testing::Test
+{
+  protected:
+    // 测试包装器
+    void AssertReverseVowels(const std::string &input, const std::string &expected)
+    {
+        char buffer[1024];
+        strncpy(buffer, input.c_str(), sizeof(buffer));
+        buffer[sizeof(buffer) - 1] = '\0'; // 保证结尾
+
+        char *result = reverseVowels(buffer);
+        EXPECT_STREQ(result, expected.c_str());
+    }
+};
+
+// 示例 1
+TEST_F(ReverseVowelsTest, Example1)
+{
+    AssertReverseVowels("IceCreAm", "AceCreIm");
+}
+
+// 示例 2
+TEST_F(ReverseVowelsTest, Example2)
+{
+    AssertReverseVowels("leetcode", "leotcede");
+}

tests/test_387.cpp

@@ -0,0 +1,51 @@
+#include <gtest/gtest.h>
+#include <solution/387.h>
+
+class FirstUniqCharTest : public ::testing::Test
+{
+  protected:
+    void AssertFirstUniqChar(const std::string &input, int expected)
+    {
+        char buf[1001];
+        strncpy(buf, input.c_str(), sizeof(buf));
+        buf[1000] = '\0'; // 防止越界
+        int result = firstUniqChar(buf);
+        EXPECT_EQ(result, expected);
+    }
+};
+
+// 示例 1：leetcode → 'l' 是第一个唯一字符，索引 0
+TEST_F(FirstUniqCharTest, Example1)
+{
+    AssertFirstUniqChar("leetcode", 0);
+}
+
+// 示例 2：loveleetcode → 'v' 是第一个唯一字符，索引 2
+TEST_F(FirstUniqCharTest, Example2)
+{
+    AssertFirstUniqChar("loveleetcode", 2);
+}
+
+// 示例 3：aabb → 没有唯一字符，返回 -1
+TEST_F(FirstUniqCharTest, Example3)
+{
+    AssertFirstUniqChar("aabb", -1);
+}
+
+// 边界测试：空字符串
+TEST_F(FirstUniqCharTest, EmptyString)
+{
+    AssertFirstUniqChar("", -1);
+}
+
+// 边界测试：单字符
+TEST_F(FirstUniqCharTest, SingleChar)
+{
+    AssertFirstUniqChar("z", 0);
+}
+
+// 更多测试：末尾唯一字符
+TEST_F(FirstUniqCharTest, UniqueAtEnd)
+{
+    AssertFirstUniqChar("aabbc", 4); // 'c' 是唯一字符
+}

tests/test_392.cpp

@@ -0,0 +1,66 @@
+#include <gtest/gtest.h>
+#include <solution/392.h>
+
+class IsSubsequenceTest : public ::testing::Test
+{
+  protected:
+    void AssertIsSubsequence(const std::string &s, const std::string &t, bool expected)
+    {
+        char s_buf[1001], t_buf[1001];
+        strncpy(s_buf, s.c_str(), sizeof(s_buf));
+        s_buf[1000] = '\0';
+        strncpy(t_buf, t.c_str(), sizeof(t_buf));
+        t_buf[1000] = '\0';
+        bool result = isSubsequence(s_buf, t_buf);
+        EXPECT_EQ(result, expected);
+    }
+};
+
+// 示例 1：s = "abc", t = "ahbgdc" → true
+TEST_F(IsSubsequenceTest, Example1)
+{
+    AssertIsSubsequence("abc", "ahbgdc", true);
+}
+
+// 示例 2：s = "axc", t = "ahbgdc" → false
+TEST_F(IsSubsequenceTest, Example2)
+{
+    AssertIsSubsequence("axc", "ahbgdc", false);
+}
+
+// 边界测试：s 为空 → 总是 true
+TEST_F(IsSubsequenceTest, EmptyS)
+{
+    AssertIsSubsequence("", "anystring", true);
+}
+
+// 边界测试：t 为空 → 只有 s 也为空才为 true
+TEST_F(IsSubsequenceTest, EmptyT)
+{
+    AssertIsSubsequence("a", "", false);
+    AssertIsSubsequence("", "", true);
+}
+
+// s 比 t 长 → false
+TEST_F(IsSubsequenceTest, SLongerThanT)
+{
+    AssertIsSubsequence("abcdefg", "abc", false);
+}
+
+// s 与 t 完全相同 → true
+TEST_F(IsSubsequenceTest, SameString)
+{
+    AssertIsSubsequence("abcde", "abcde", true);
+}
+
+// 非连续但顺序正确 → true
+TEST_F(IsSubsequenceTest, SparseSubsequence)
+{
+    AssertIsSubsequence("ace", "abcde", true);
+}
+
+// 非连续顺序错误 → false
+TEST_F(IsSubsequenceTest, WrongOrder)
+{
+    AssertIsSubsequence("aec", "abcde", false);
+}

tests/test_509.cpp

@@ -0,0 +1,39 @@
+// This file is generated by mkfile.py
+// Date: 2025-12-05
+
+#include <gtest/gtest.h>
+#include <solution/509.h>
+// Tests for fib (LeetCode 509)
+class FibTest : public ::testing::Test
+{
+  protected:
+    void AssertFib(int n, int expected)
+    {
+        ASSERT_EQ(fib(n), expected);
+    }
+};
+
+TEST_F(FibTest, Zero)
+{
+    AssertFib(0, 0);
+}
+
+TEST_F(FibTest, One)
+{
+    AssertFib(1, 1);
+}
+
+TEST_F(FibTest, Two)
+{
+    AssertFib(2, 1);
+}
+
+TEST_F(FibTest, Ten)
+{
+    AssertFib(10, 55);
+}
+
+TEST_F(FibTest, Twenty)
+{
+    AssertFib(20, 6765);
+}

tests/test_746.cpp

@@ -0,0 +1,47 @@
+// This file is generated by mkfile.py
+// Date: 2025-12-05
+
+#include <gtest/gtest.h>
+#include <solution/746.h>
+
+#include <algorithm>
+#include <vector>
+
+// Tests for minCostClimbingStairs (LeetCode 746)
+class MinCostClimbingStairsTest : public ::testing::Test
+{
+  protected:
+    void AssertMinCost(const std::vector<int> &input, int expected)
+    {
+        int *cost = new int[input.size()];
+        std::copy(input.begin(), input.end(), cost);
+
+        int result = minCostClimbingStairs(cost, (int)input.size());
+        ASSERT_EQ(result, expected);
+
+        delete[] cost;
+    }
+};
+
+TEST_F(MinCostClimbingStairsTest, Example1)
+{
+    // cost = [10,15,20] -> expected 15
+    AssertMinCost({10, 15, 20}, 15);
+}
+
+TEST_F(MinCostClimbingStairsTest, Example2)
+{
+    // cost = [1,100,1,1,1,100,1,1,100,1] -> expected 6
+    AssertMinCost({1, 100, 1, 1, 1, 100, 1, 1, 100, 1}, 6);
+}
+
+TEST_F(MinCostClimbingStairsTest, TwoSteps)
+{
+    // Two steps: choose cheaper one
+    AssertMinCost({5, 3}, 3);
+}
+
+TEST_F(MinCostClimbingStairsTest, ZeroCost)
+{
+    AssertMinCost({0, 0, 0}, 0);
+}

tests/test_976.cpp

@@ -0,0 +1,65 @@
+#include <gtest/gtest.h>
+#include <solution/976.h>
+// 测试类定义
+class LargestPerimeterTest : public ::testing::Test
+{
+  protected:
+    void AssertLargestPerimeter(std::vector<int> input, int expected)
+    {
+        int *nums = new int[input.size()];
+        std::copy(input.begin(), input.end(), nums);
+
+        int result = largestPerimeter(nums, input.size());
+        ASSERT_EQ(result, expected);
+
+        delete[] nums;
+    }
+};
+
+// 示例 1
+TEST_F(LargestPerimeterTest, Example1)
+{
+    // 输入: nums = [2,1,2]
+    // 输出: 5
+    AssertLargestPerimeter({2, 1, 2}, 5);
+}
+
+// 示例 2
+TEST_F(LargestPerimeterTest, Example2)
+{
+    // 输入: nums = [1,2,1,10]
+    // 输出: 0
+    AssertLargestPerimeter({1, 2, 1, 10}, 0);
+}
+
+// 边界测试：最小输入
+TEST_F(LargestPerimeterTest, SmallestInput)
+{
+    // 输入: nums = [3,4,5]
+    // 输出: 12
+    AssertLargestPerimeter({3, 4, 5}, 12);
+}
+
+// 边界测试：无法组成三角形的情况
+TEST_F(LargestPerimeterTest, CannotFormTriangle)
+{
+    // 输入: nums = [1,1,2]
+    // 输出: 0
+    AssertLargestPerimeter({1, 1, 2}, 0);
+}
+
+// 边界测试：重复元素
+TEST_F(LargestPerimeterTest, RepeatedElements)
+{
+    // 输入: nums = [3,3,3,3,3]
+    // 输出: 9
+    AssertLargestPerimeter({3, 3, 3, 3, 3}, 9);
+}
+
+// 边界测试：无有效三角形
+TEST_F(LargestPerimeterTest, NoValidTriangle)
+{
+    // 输入: nums = [1,1,1,10]
+    // 输出: 3
+    AssertLargestPerimeter({1, 1, 1, 10}, 3);
+}