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

LeetCode之Two Sum

編輯:C++入門知識

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

LeetCode Discuss

O(N) time / O(N) space

class Solution {
public:
    vector twoSum(vector &numbers, int target) {
        vector result;
		if (numbers.size() < 2) return result;
		map mp;
		int i, j;
		for (i = 0; i < numbers.size(); i++){
		    map::iterator it_1 = mp.find(numbers[i]);
		    if (it_1 == mp.end()) {
			    mp.insert(make_pair(numbers[i], i + 1));
			}
			
			map::iterator it_2 = mp.find(target - numbers[i]);
			if (it_2 != mp.end()) {
				 j = mp[target - numbers[i]];
				 if(jj?i+1:j);
    }
};


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