Description:Description:
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类型的target,返回数组的两个index使得这两个index所代表的数的和等于target,假设index不相同,和唯一。
代码如下:
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
int* twoSum(int* nums, int numsSize, int target) {
//int indices[2] = {0, 0};
int *arr =(int *) malloc(2 * sizeof(int));
for(int i = 0; i < numsSize; i++) {
for(int j = 0; j < numsSize; j++) {
if(j != i && nums[i] + nums[j] == target) {
arr[0] = j;
arr[1] = i;
// return arr;
}
}
}
return arr;
}
大概就是malloc申请大小为2的数组,然后将遍历后符合条件的index赋值进去,这里要注意上面的假设index不唯一即遍历的时候加一个判定,这里自己的代码因为遍历次数比较多,如果按照题目要求,我的if是前后运行了两遍,一遍i,j,一遍j,i,所以这里取了个巧,先j后i,最后得到的index是先i后j。