3397

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/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

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/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;
+}

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_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);
+}