1、题目来源链接
中文网站: https://leetcode-cn.com/problems/two-sum/
英文网站: https://leetcode.com/problems/two-sum/
2、题目
中文题目:
给定一个整数数组 nums 和一个整数目标值 target,请你在该数组中找出 和为目标值 target 的那 两个 整数,并返回它们的数组下标。
你可以假设每种输入只会对应一个答案。但是,数组中同一个元素在答案里不能重复出现。
你可以按任意顺序返回答案。
英文题目:
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return the answer in any order.
示例 1:
输入:nums = [2,7,11,15], target = 9
输出:[0,1]
解释:因为 nums[0] + nums[1] == 9 ,返回 [0, 1] 。
示例 2:
输入:nums = [3,2,4], target = 6
输出:[1,2]
示例 3:
输入:nums = [3,3], target = 6
输出:[0,1]
C语言代码:
#include<stdio.h>
#include<stdlib.h>
int main(){
int* twoSum(int* nums, int numsSize, int target, int* returnSize);
int nums[4] = {2,7,11,15};
int numsSize = 4;
int target = 9;
int returnSize=0;
int *result = (int*)malloc(sizeof(int)*2); //为数组result申请2个整型大小空间
result = twoSum(nums, 4,9,&returnSize);
for(int i =0; i < returnSize; i++)
printf("[%d] ",result[i]);
printf("[%d, %d]",result[0],result[1]);
return 0;
}
int* twoSum(int* nums, int numsSize, int target, int* returnSize){
int *result = (int*)malloc(sizeof(int)*2);
for(int i=0; i < numsSize; i++){
for(int j=i+1; j < numsSize; j++){
if(nums[i] + nums[j] == target){ //判断两个数的值是否与目标相等
result[0] = i;
result[1] = j;
*returnSize = 2;
return result;
}
}
}
*returnSize = 0;
return NULL;
}