#include <iostream>#include <algorithm>#include <map>#include <vector>#include <utility>using namespace std;class Solution{ public: vector<int> twoSum ( vector<int> &nums, int target ) {vector<int> pg; //存放返回值map<int, int> Map;vector<int>::size_type i=0;for( ; i<nums.size() ; i++ ){if ( ! Map.count(nums[i]) ){Map.insert( make_pair( nums[i], i ) ) ; //插入, key是值, value 是下标}int tar = target – nums[i];if( Map.count (tar) ){int n= Map[tar];if ( n < i ){pg.push_back(n+1);pg.push_back(i+1);}}}return pg;}};用两层循环会提示超时错误.,好严格啊!
，快乐时，想想我的影子，我会在云上为你喝彩
