LeetCode-TwoSUM
- 题目要求
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)
- {
- static int a[2]={0.0};
-
- for (a[0] = 0; a[0] <numsSize; a[0]++)
- {
- for (a[1] = a[0]+1; a[1] <numsSize; a[1]++)
- {
- if(nums[a[0]]+nums[a[1]]==target)
- {
-
- return a;
- }
- }
- }
- return 0;
- }
- 提交结果,内存占用还是很客观的,但是运行效率就不是太理想。
- 官方解决方案中是用哈希算法来实现的 解决方案