1. Two Sum

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].

C++:

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target)
    {
        unordered_map<int,int> m;
        for(int i=0;i<nums.size();i++)
        {
            if(m.count(target-nums[i]))
            {
                return {i,m[target-nums[i]]};                
            }
            m[nums[i]]=i;
        }
        return {};       
    }
};

python:
1.两次遍历,第一次遍历找出数组下标和值的对应关系,存到dict里面。第二次遍历nums[i],找target-nums[i]是否在dict。

enumerate() 函数用于将一个可遍历的数据对象(如列表、元组或字符串)组合为一个索引序列,同时列出数据和数据下标,一般用在 for 循环当中。

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        res_dict={}
        if len(nums)<2:
            pass
        for i,num in enumerate(nums):
            res_dict[num]=i
        for i, num in enumerate(nums):
            if target - num in res_dict and res_dict[target - num] != i:
                return [i, res_dict[target - num]]

2.一次遍历:

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        res_dict={}
        if len(nums)<2:
            pass
        for i,num in enumerate(nums):
            if target-num in res_dict:
                return [res_dict[target-num],i]
            else:
                res_dict[num]=i
        return [0,0]
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值