程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> LeetCode:Two Sum淺析

LeetCode:Two Sum淺析

編輯:C++入門知識

LeetCode:Two Sum淺析


 

Two Sum

  Total Accepted:199288Total Submissions:913621Difficulty:Easy  

 

Given an array of integers, returnindicesof the two numbers such that they add up to a specific target.

You may assume that each input would haveexactlyone solution.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

 

UPDATE (2016/2/13):
The return format had been changed tozero-basedindices. Please read the above updated description carefully.

 

Hide Tags ArrayHash Table Hide Similar Problems (M) 3Sum(M) 4Sum(M) Two Sum II - Input array is sorted(E) Two Sum III - Data structure design            

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

code:

 

 

class Solution {
public:
    vector twoSum(vector& nums, int target) {
        map m;
        vector ret;
        for(int i=0;ii){
                ret.push_back(i);
                ret.push_back(m[tmp]);
                break;
            }
        }
        return ret;
    }
};


 

 

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved