mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2024-11-22 05:21:49 +03:00
Code Issues Packages Projects Releases Wiki Activity

fix: comments on includes. Doxygen file. static test function

Browse Source
This commit is contained in:
straight-into-the-wall 2021-10-22 21:36:49 +02:00
parent 80e54d94f9
commit 23c0485933
1 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
leetcode/src/1.c
View File

@ -1,5 +1,5 @@
/**
* @file 1.c
* @file
* @brief TwoSum leetcode problem solution.
* @details
* This is a recursive solution for the leetcode problem of TwoSum.
@ -7,8 +7,9 @@
* @see https://leetcode.com/problems/two-sum/
*/
#include <assert.h>
#include <stdlib.h>
#include <assert.h> /// for assert
#include <stdint.h> /// for unsigned int with fixed size
#include <stdlib.h> /// for everithing else
int* ending(int* a, int* b, int* returnSize);
@ -56,7 +57,7 @@ int* ending(int* a, int* b, int* returnSize)
* @brief Self-test implementations
* @returns void
*/
void testTwoSum(int* nums, int numsSize, int target)
static void testTwoSum(int* nums, int numsSize, int target)
{
int retSize = 0;
int* ret = twoSum(nums, numsSize, target, &retSize);
@ -67,7 +68,7 @@ void testTwoSum(int* nums, int numsSize, int target)
assert(!target);
}
void test(void)
static void test(void)
{
int nums[4] = {2, 7, 11, 15};
testTwoSum(nums, 4, 9);