一起刷LeetCode1-Two Sum

　　感觉有必要重新刷刷题了，为以后找工作做做准备，选择LeetCode+topcoder上的Data Science Tutorials，

争取每天晚上10:00开始刷一道，复习一下相关知识点。

-------------------------------------------------------分割线啦-----------------------------------------------------------------------

Two Sum

 

Given an array of integers, 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

【题意】：这题意思就是给定一些数，再给你一个目标数字，让你在给定的那些数字中找出两个数，这两个数的和等于目标数字。注意给定的这些数字是无序的。

【心路历程】：看到这题，简单想了想，就知道O(n*2)的遍历一定会超时。于是进一步的思考，感觉特别像hash，可是懒得实现hash。。。

就开始想想还有没有别的方法。感觉这种无序的数字，排序后都会比较好处理一点。就开始往排序上想，发现排好序后确实比较好处理。

我们用两个下标，一个指向开始beg，一个指向末尾end，我们去比较target减去beg指向的数字，与end指向的数字。如果target-beg == end ，就找到了；

如果 target-beg > end ，就beg++；如果target-beg < end ，就end--。这样的话，时间复杂度是O(n*logn)。我感觉差不多可以接受，就交了，ac。

为了学习知识，ac不是目的，我看了一下官方解法：

O(n2) runtime, O(1) space – Brute force:

The brute force approach is simple. Loop through each element x and find if there is another value that equals to target – x.

As finding another value requires looping through the rest of array, its runtime complexity is O(n2).

O(n) runtime, O(n) space – Hash table:

We could reduce the runtime complexity of looking up a value to O(1) using a hash map that maps a value to its index.

- -，最佳答案就是Hash，O(n)。

---------------------------------------------------------又是分割线啦----------------------------------------------------------------------

附上代码：

(1)这个是O(n*logn)的排序+首尾下标：

 1 /**

 2  * Note: The returned array must be malloced, assume caller calls free().

 3  */

 4 struct node {

 5         int num;

 6         int local;

 7 };

 8 

 9 int cmp(const void * a,const void *b) {

10     struct node * aa = (struct node *)a;

11     struct node * bb = (struct node *)b;

12     if(aa->num == bb->num) {

13         return aa->local - bb->local;

14     }else{

15         return aa->num - bb->num;

16     }

17 }

18 int* twoSum(int* nums, int numsSize, int target) {

19     

20     struct node* a = (struct node*)malloc(numsSize*(sizeof(struct node)));

21     int * vis = (int *)malloc(2*sizeof(int));

22     int beg = 0,end = numsSize-1,i;

23     for(i = 0; i < numsSize; i++) {

24         a[i].num = nums[i];

25         a[i].local = i+1;

26     }

27     qsort(a,numsSize,sizeof(a[0]),cmp);

28     for(; beg < end;){

29         int ans = target - a[beg].num;

30         while(1){

31             if(a[end].num == ans){

32                 if(a[beg].local < a[end].local){

33                     vis[0] = a[beg].local;

34                     vis[1] = a[end].local;

35                 }else {

36                     vis[0] = a[end].local;

37                     vis[1] = a[beg].local;

38                 }

39                 return vis;

40             }else if(a[end].num < ans){

41                 beg++;

42                 break;

43             }else {

44                 end--;

45             }

46         }

47     }

48     free(a);

49 }

(2)用c++提供的map模拟hash：

 1 class Solution {

 2 public:

 3     vector<int> twoSum(vector<int>& nums, int target) {

 4         map<int,int>a;

 5         int i,len;

 6         len = nums.size();

 7         for(i = 0; i < len; i++) {

 8             int ans = target - nums[i];

 9             if(a.count(nums[i])){

10                 vector<int> res;

11                 int ans1,ans2;

12                 ans1 = i+1;

13                 ans2 = a[nums[i]];

14                 if(ans1 > ans2) {

15                     res.push_back(ans2);

16                     res.push_back(ans1);

17                     return res;

18                 }else {

19                     res.push_back(ans1);

20                     res.push_back(ans2);

21                     return res;

22                 }

23             }

24             a[ans] = i+1;

25         }

26     }

27 };