LeetCode twosum C
2017-02-06 00:00
309 查看
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
int *twosum(int *nums, int numSize, int target)
{
int i = 0;
int j = 0;
for (i = 0; i < numSize - 1; i++)
{
for (j = i + 1; j < numSize; j++)
{
if (nums[i] + nums[j] == target)
{
int *index = (int*)malloc(2 * sizeof(int));
index[0] = i;
index[1] = j;
return index;
}
}
}
return NULL;
}
int main(int argc, char *argv[])
{
int nums[6] = {2, 4, 6, 7, 15, 19};
int size = sizeof(nums) / sizeof(int);
int *index = twosum(nums, size, 9);
if (index == NULL)
{
return 0;
}
printf("%d, %d\n", index[0], index[1]);
free(index);
return 0;
}
#include <stdio.h>
#include <string.h>
int *twosum(int *nums, int numSize, int target)
{
int i = 0;
int j = 0;
for (i = 0; i < numSize - 1; i++)
{
for (j = i + 1; j < numSize; j++)
{
if (nums[i] + nums[j] == target)
{
int *index = (int*)malloc(2 * sizeof(int));
index[0] = i;
index[1] = j;
return index;
}
}
}
return NULL;
}
int main(int argc, char *argv[])
{
int nums[6] = {2, 4, 6, 7, 15, 19};
int size = sizeof(nums) / sizeof(int);
int *index = twosum(nums, size, 9);
if (index == NULL)
{
return 0;
}
printf("%d, %d\n", index[0], index[1]);
free(index);
return 0;
}
相关文章推荐
- leetcode之TwoSum[Java]
- leetcode 167: Two Sum II - Input array is sorted
- Two Sum —— leetcode
- LeetCode(Two Sum)
- LeetCode 编程练习 - Two Sum II - Input array is sorted学习心得
- LeetCode - 371 - Sum of Two Integers
- leetcode--TWO SUM延伸(假设答案不唯一、假设输入有相同数字)
- leetcode Two Sum
- leetcode -- Two Sum II - Input array is sorted
- Two Sum leetcode java
- [Leetcode] 1.Two Sum(unordered_map)
- Leetcode Two Sum
- leetcode[Minimum Index Sum of Two Lists]//待整理多种解法
- LeetCode-Two Sum(编程之美-快速寻找满足条件的两个数字)
- LeetCode--two-sum
- [leetcode]leetcode第一题 1. Two Sum java O(n)解法
- LeetCode 1. Two Sum 解析
- LeetCode Two Sum
- leetcode之two sum
- Leetcode twosum