leetcode1 : twosum

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

(1)暴力搜索法（穷举）：时间复杂度O(N^2)，空间复杂度O(1)

class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        std::vector<int> index(2, 0);
        if(numbers.size() < 2)
            return index;
        for(std::vector<int>::iterator i = numbers.begin(); i != numbers.end() - 1; ++i)
        {
            int last_val = target - *i;
            std::vector<int>::iterator j = std::find(i + 1, numbers.end(), last_val);
            if(j != numbers.end())
            {
                index[0] = i - numbers.begin() + 1;
                index[1] = j - numbers.begin() + 1;
                break;
            }
        }
        return index;
    }
};

(2)hashtable（c++，ordered_map容器）法:时间复杂度O(N)，空间复杂度O(N)

以键值对（key-val）的形式将未能匹配的元素添加到hashtable对象中，接着继续搜索。map对象是以numbers的值为键，以当前元素下标为值进行搜索。                  

                std::vector <int> index(2, 0);
                 std::unordered_map <int, size_t> index_nums;
                 std::unordered_map <int, size_t>:: iterator it ;
                 for (std ::vector< int>::size_type i = 0; i != numbers .size(); ++ i)
                {
                                 it = index_nums .find( target - numbers [i]);
                                 if (it != index_nums. end())
                                {
                                                 index[0] = i + 1;
                                                 index[1] = it ->second + 1;
                                                 std::sort (index.begin(), index.end ());
                                                 break;
                                }
                                 index_nums.insert (std:: unordered_map<int , size_t>:: value_type(numbers [i], i));
                }
                 return index ;

（3）前向指针后向指针法：时间复杂度O(N），空间复杂度O(N)

struct Node
{
     int num, pos;
     Node(const int& i, const int& val):
          num(val), pos(i)
     {

     }
};

struct Greater
{
     bool operator()(const Node& lhs, const Node& rhs)
     {
          return (lhs.num < rhs.num);
     }
};

class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
     //Solution 2
     std::vector<int> index(2, 0);
     std::vector<Node> ivec;
     for (size_t i = 0; i != numbers.size(); ++i)
     {
          Node temp(i, numbers[i]);
          ivec.push_back(temp);
     }
     std::sort(ivec.begin(), ivec.end(), Greater());
     int begin = 0, last = numbers.size() - 1;
     while (begin < last)
     {
          int sum = ivec[begin].num + ivec[last].num;
          if (sum < target)
               ++begin;
          else if (sum > target)
              --last;
          else
          {
               index[0] = ivec[begin].pos + 1;
               index[1] = ivec[last].pos + 1;
               std::sort(index.begin(), index.end());
               break;
          }
     }
     return index;
    }
};