【Leetcode】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

#include "stdafx.h"
#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
//结果要返回的是两个值的索引，因此用vector来保存一次输出
vector<int> twoSum(vector<int> &numbers, int target) {
    unordered_map<int, int> m;
    vector<int> result;
    for (int i = 0; i<numbers.size(); i++) {
        // not found the second one
        if (m.find(numbers[i]) == m.end()) {
            // store the first one poisition into the second one's key
            m[target - numbers[i]] = i;
        }
        else {
            // found the second one
            result.push_back(m[numbers[i]] + 1);
            result.push_back(i + 1);
            break;
        }
    }
    return result;
}

unordered_map相关知识
1.哈希map是一种关联容器，通过键值和映射值存储元素。允许根据键值快速检索各个元素。
2.哈希map允许使用操作运算符（运算符[]）以其键值作为参数直接访问元素。即是m[key].
3.m.find(numbers[i])里面是键值，查找键值，m.find(numbers[i]) == m.end()表明没有重复的键值。

UPDATA///

/******************************************************************
/时间复杂度O（N），空间复杂度O（1）
/前期是有序
/定义前后指针
/********************************************************************/
vector<int> findSum(vector<int>&vec, int target)
{
    //sort(s,s+n);   如果数组非有序的，那就事先排好序O（N*logN）  
    vector<int> result;
    auto start = vec.begin();
    auto end = vec.end() - 1;
    while (start<end)
    {
        if ((*start + *end)>target)
            --end;
        else if ((*start + *end) < target)
            ++start;
        else
        {
            result.push_back(*start);
            result.push_back(*end);     
            --end;
            ++start;
        }
    }
    return result;  
}