首页 > 其他 > 详细

leetcode 1 twoSum

时间:2015-06-14 09:35:00      阅读:184      评论:0      收藏:0      [点我收藏+]



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 <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;
}

};


第一次用两个循环失败了,提示超时....

leetcode 1 twoSum

原文:http://blog.csdn.net/nizhannizhan/article/details/46484361

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!