LeetCode-TwoSUM

LeetCode-TwoSUM

算法 LeetCodeTwoSUM

---

1. 题目要求
   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].

2. 题目分析

3. 自己程序

1. int* twoSum(int* nums, int numsSize, int target) 

   ---

2. { 

   ---

3. static int a[2]={0.0}; 

   ---

4.  

   ---

5. for (a[0] = 0; a[0] <numsSize; a[0]++) 

   ---

6. { 

   ---

7. for (a[1] = a[0]+1; a[1] <numsSize; a[1]++) 

   ---

8. { 

   ---

9. if(nums[a[0]]+nums[a[1]]==target) 

   ---

10. { 

    ---

11.  

    ---

12. return a; 

    ---

13. } 

    ---

14. } 

    ---

15. } 

    ---

16. return 0; 

    ---

17. }  

    ---

• 提交结果，内存占用还是很客观的，但是运行效率就不是太理想。
  

4. 官方解决方案中是用哈希算法来实现的 解决方案