-
Notifications
You must be signed in to change notification settings - Fork 0
/
1.两数之和.c
56 lines (50 loc) · 1.28 KB
/
1.两数之和.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
/*
* @lc app=leetcode.cn id=1 lang=c
*
* [1] 两数之和
*
* https://leetcode-cn.com/problems/two-sum/description/
*
* algorithms
* Easy (49.23%)
* Likes: 8916
* Dislikes: 0
* Total Accepted: 1.3M
* Total Submissions: 2.6M
* Testcase Example: '[2,7,11,15]\n9'
*
* 给定一个整数数组 nums 和一个目标值 target,请你在该数组中找出和为目标值的那 两个 整数,并返回他们的数组下标。
*
* 你可以假设每种输入只会对应一个答案。但是,数组中同一个元素不能使用两遍。
*
*
*
* 示例:
*
* 给定 nums = [2, 7, 11, 15], target = 9
*
* 因为 nums[0] + nums[1] = 2 + 7 = 9
* 所以返回 [0, 1]
*
*
*/
// @lc code=start
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* twoSum(int* nums, int numsSize, int target, int* returnSize){
int *a = (int*)malloc(2 * sizeof(int));
for (int i = 0; i < numsSize - 1; i++){
for (int j = i+1; j < numsSize; j++){
if (nums[i] + nums[j] == target){
a[0] = i;
a[1] = j;
*returnSize=2;
return a;
}
}
}
*returnSize=0;
return 0;
}
// @lc code=end