刷了一下LeetCode的题目,第一道题就被坑倒了,明明是一个简单的题,我也用了最流氓的手段解出来,为什么还不对呢?后来我发现了原因,是因为数组和指针的关系,动态申请内存的知识点方面的问题,看来我还是得回去好好复习一下C语言呀!上面就说说这道题吧!
题目:
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) {
/*
利用malloc函数动态申请数组空间,此时的p就相当于数组名
malloc函数的格式:(type*)malloc (sizeof(type)*n) n为元素的个数
*/
int*p=(int*)malloc(sizeof(int)*2);
int i,j;
for(i=0;i<numsSize;i++)
{
for(j=0;(j<numsSize)&&(j!=i);j++)
{
if(nums[i]+nums[j]==target)
{
if(i>j) { p[0]=j;p[1]=i;}
else {p[0]=i;p[1]=j;}
}
}
}
return p;
}