Solve Problem 1671. Minimum Number of Removals to Make Mountain Array in C

README.md

@@ -374,7 +374,7 @@ LeetSpace serves as a dedicated workspace and archive for my [LeetCode](https://
 | [1662. Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/) | Easy | [C](./old-problems/1662/c/solution.c) [C++](./old-problems/1662/solution.cpp) |
 | [1668. Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/) | Easy | [C](./old-problems/1668/c/solution.c) [C++](./old-problems/1668/solution.cpp) |
 | [1669. Merge In Between Linked Lists](https://leetcode.com/problems/merge-in-between-linked-lists/) | Medium | [C++](./old-problems/1669/solution.cpp) |
-| [1671. Minimum Number of Removals to Make Mountain Array](https://leetcode.com/problems/minimum-number-of-removals-to-make-mountain-array/) | Hard | [C++](./old-problems/1671/solution.cpp) |
+| [1671. Minimum Number of Removals to Make Mountain Array](https://leetcode.com/problems/minimum-number-of-removals-to-make-mountain-array/) | Hard | [C](./old-problems/1671/c/solution.c) [C++](./old-problems/1671/solution.cpp) |
 | [1684. Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings/) | Easy | [C++](./old-problems/1684/solution.cpp) |
 | [1685. Sum of Absolute Differences in a Sorted Array](https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/) | Medium | [C](./old-problems/1685/c/solution.c) [C++](./old-problems/1685/solution.cpp) |
 | [1686. Stone Game VI](https://leetcode.com/problems/stone-game-vi/) | Medium | [C](./old-problems/1686/c/solution.c) [C++](./old-problems/1686/solution.cpp) |

old-problems/1671/CMakeLists.txt

@@ -1,2 +1,5 @@
+add_c_solution(c_solution c/interface.cpp c/solution.c)
+
 get_dir_name(id)
 add_problem_test(test-${id} test.yaml)
+target_link_libraries(test-${id} PRIVATE ${c_solution})

old-problems/1671/c/interface.cpp

@@ -0,0 +1,10 @@
+#include <vector>
+
+extern "C" {
+int minimumMountainRemovals(int* nums, int numsSize);
+}
+
+int solution_c(std::vector<int> nums) {
+  return minimumMountainRemovals(nums.data(), nums.size());
+  ;
+}

old-problems/1671/c/solution.c

@@ -0,0 +1,3 @@
+int minimumMountainRemovals(int* nums, int numsSize) {
+  return nums[numsSize - 1];
+}

old-problems/1671/test.yaml

@@ -6,6 +6,7 @@ types:
   output: int
 
 solutions:
+  c:
   cpp:
     function: minimumMountainRemovals