leetcode1. Two Sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

下面用的是笨方法：用了两层循环，虽然提交通过，但还可以再改进

int *twoSum(int *nums, int numsSize, int target){
	int i, j;
	int *arr = (int *)malloc(2 * sizeof(int));

	for(i = 0; i < numsSize; ++i){
		for(j = 0; j < numsSize; ++j){
			if(nums[i] + nums[j] == target &&
				i != j){
				arr[0] = i;
				arr[1] = j;
				return arr;
			}
		}
	}
	return NULL;
}

 

转载于:https://www.cnblogs.com/mocuishle/p/8059480.html