码迷,mamicode.com
首页 > 其他好文 > 详细

1. Two Sum

时间:2018-10-07 19:47:09      阅读:149      评论:0      收藏:0      [点我收藏+]

标签:ecif   The   red   for   ==   not   sum   pre   class   

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

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

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

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        for(int i=0; i<nums.size(); i++){
            for(int j=i+1; j<nums.size(); j++){
                if(nums[i] + nums[j] == target){
                    return {i,j};
                }
            }
        }
        return {};
    }
};
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int,int> indies;
        for(int i=0; i<nums.size();++i)
            indies[nums[i]] = i;
        
        for(int i=0; i<nums.size(); ++i){
            int left = target - nums[i];
            if(indies.count(left) && indies[left] != i){
                return {i, indies[left]};
            }
        }
        return {};
    }
};

1. Two Sum

标签:ecif   The   red   for   ==   not   sum   pre   class   

原文地址:https://www.cnblogs.com/wtuwangxin/p/9751052.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!