您好,登录后才能下订单哦!
密码登录
登录注册
点击 登录注册 即表示同意《亿速云用户服务条款》
Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based. You may assume that each input would have exactly one solution. Input: numbers={2, 7, 11, 15}, target=9 Output: index1=1, index2=2
题意:一个排好序的数组,升序。给你一个数,从数组中找到和为这个数的俩索引,索引不是从0开始的。。。。。。且只有一组答案
/** * Return an array of size *returnSize. * Note: The returned array must be malloced, assume caller calls free(). */ int* twoSum(int* numbers, int numbersSize, int target, int* returnSize) { //复杂度不行啊! // int i,j; // int *a=(int*)malloc(sizeof(int)*2); // for(i=0;i<numbersSize;i++){ // for(j=i+1;j<numbersSize;j++){ // if(numbers[i]+numbers[j]==target){ // a[0]=i+1; // a[1]=j+1; // break; // } // } // } // *returnSize=2; // return a; int i=0; int j=numbersSize-1; int *a=(int*)malloc(sizeof(int)*2); while(i<j){ if(numbers[i]+numbers[j]==target){ a[0]=i+1; a[1]=j+1; break; } if(numbers[i]+numbers[j]>target){ j--; } if(numbers[i]+numbers[j]<target){ i++; } } *returnSize=2; return a; }
PS:俩for循环果然超时。
躺在床上想,会不会是双指针问题。第二天做完提交,是的,典型的双指针问题。啊哈哈,终于学到了。
免责声明:本站发布的内容(图片、视频和文字)以原创、转载和分享为主,文章观点不代表本网站立场,如果涉及侵权请联系站长邮箱:is@yisu.com进行举报,并提供相关证据,一经查实,将立刻删除涉嫌侵权内容。