LeetCode1——Two Sum

xiaoxiao2021-02-27  173

/** * Note: The returned array must be malloced, assume caller calls free(). */ int* twoSum(int* nums, int numsSize, int target) { if(NULL==nums) return -1; int* index=(int*)malloc(sizeof(int)*2); for(int i=0;i<numsSize-1;i++) { for(int j=i+1;j<numsSize;j++) { if(target==nums[i]+nums[j]) { index[0]=i; index[1]=j; return index; } } } return 0; }

转载请注明原文地址: https://www.6miu.com/read-9367.html

最新回复(0)