LeetCode题库第一题
给定一个整数数组 nums 和一个目标值 target,请你在该数组中找出和为目标值的那 两个 整数,并返回他们的数组下标。
你可以假设每种输入只会对应一个答案。但是,你不能重复利用这个数组中同样的元素。
如:给定 nums = [2, 7, 11, 15], target = 9
因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]
#include<stdio.h>
#include<stdlib.h>
int* twoSum(int* nums, int numsSize, int target, int* returnSize);
int main(){
int nums[] = {2,0,5,6,9,10};
int numsSize = sizeof(nums)/sizeof(int);
printf("numsSize = %d\n",numsSize);
int target = 9;
int returnSize[2] = {0,0};
twoSum(nums, numsSize, target, returnSize);
printf("returnSize = [ %d ,%d ]",returnSize[0],returnSize[1]);
return 0;
}
int* twoSum(int* nums, int numsSize, int target, int* returnSize){
int max = 1023;//2^n-1
int* arr = (int*)malloc(sizeof(int)*(max+1));//[max+1];
for(int i = 0;i<numsSize;++i){
int diff = target - nums[i];
int index = diff & max;
if(arr[index] != 0){
returnSize[0] = arr[index]-1;
returnSize[1]=i;
free(arr);
return returnSize;
}
arr[nums[i] & max] = i+1;
}
return returnSize;
}