Two Sum
程序员文章站
2022-03-26 12:28:22
凯鲁嘎吉 - 博客园 http://www.cnblogs.com/kailugaji/ Question: Answer: ......
凯鲁嘎吉 - 博客园
http://www.cnblogs.com/kailugaji/
Question:
Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
Answer:
int* twoSum(int* nums, int numsSize, int target) { int j, i; int *test = NULL; test = (int )malloc(2*sizeof(int)); for (i=0; i<numsSize ;i++){ for (j=i+1; j<numsSize ;j++){ if(nums[i]+nums[j] == target){ *(test) = i; *(test+1) = j; } } } return test; }
Run Code Result: Your input [3,2,4] 6 Your answer [1,2] Expected answer [1,2] Show Diff Runtime: 4 ms
上一篇: python基础入门之十 —— 函数
下一篇: 前端微服务-面向web应用的新设计
推荐阅读