leetcode 1 two sum

暴力求解的方式

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector <int> result;
        for(int i=0;i<nums.size();i++)
        {
           for (int j=i+1;j<nums.size();j++)
           {
               if(nums[j]==target-nums[i])
               {
                   result.push_back(i);
                   result.push_back(j); 
                  return result;
                
               }
            
           }        
            
        }
      
        
    }
};

改进版本 不采用两层循环用unordered_map 完成

//#include<tr1/unordered_map>
#include <iostream>
#include <vector>
#include <cassert>
#include <unordered_map>
#include <map>
using namespace std;

/// Two-Pass Hash Table
/// Time Complexity: O(n)
/// Space Complexity: O(n)
class Solution {
public:
    vector <int> twoSum(vector<int>& nums, int target) {

          unordered_map<int,int> record;
          unordered_map<int,int> ::iterator it;
          
          // 首先先进行一次map 操作，时间为O(N) 
         for(int i = 0 ; i < nums.size() ; i ++)
			record[nums[i]] = i;
			
		// record->second 记录的是 数所在的位置 
		// 然后利用迭代器进行查找，注意由于两个数字不能重复
		
		for(int i = 0 ; i < nums.size() ; i ++)
	{
		unordered_map <int ,int >:: iterator iter = record.find ( target - nums [i] );
		if (iter != record.end() && iter ->second != i ) 
		{
			int res[] ={i,iter->second};
			return vector<int> (res,res+2);
		 } 	
	}

        }
			
};
		

void printVec(const vector<int>& vec){
    for(int e: vec)
        cout << e << " ";
    cout << endl;
}

int main() {

    const int nums[] = {0,4,3,0};
    vector<int> nums_vec( nums, nums + sizeof(nums)/sizeof(int) );
    int target = 0;
   vector<int> result = Solution().twoSum(nums_vec, target);
   printVec(result);
    

    return 0;
}

后续可以尝试用改进的版本写leetcode 15sum3