zoukankan      html  css  js  c++  java
  • Two Sum

    题目描述:

    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

    相信当你看见这篇博客时,已经独立思考过,这里直接给出Accepted Code。部分代码来自网络,希望不会涉及版权问题。

    Solution1:

    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> res(2);
        int n = nums.size();
        if(n < 2)
            return res;
        unordered_map<int, int> map;
        unordered_map<int, int>::const_iterator it = map.end();
        int tmp;
        for (int i = 0;i < n;++i)
        {
            tmp = target - nums[i];
            it = map.find(tmp);
            if (it != map.end())
            {
                res[0] = it->second + 1;
                res[1] = i + 1;
                return res;
            }
            else
                map[nums[i]] = i;
        }
    }

     

    后记

      这道题还有一种解法就是先排序,然后首尾两个指针遍历寻找。上述使用hash表的解法,其原理依旧是暴力破解,并不算好。(今天做3Sum有感)

    solution2:

    struct Node{
        int id,val;
    };
    bool compare(const Node &a, const Node &b){
        return a.val < b.val;
    }
    
    vector<int> twoSum(vector<int> &numbers, int target) {
        vector<Node> nodes(numbers.size());
        for(int i = 0;i < numbers.size();++i){
            nodes[i].id = i+1;
            nodes[i].val = numbers[i];
        }
        sort(nodes.begin(),nodes.end(),compare);
        int start = 0, end = numbers.size()-1;
        vector<int> res;
        while(start < end){
            if(nodes[start].val + nodes[end].val == target){
                if(nodes[start].id > nodes[end].id)
                    swap(nodes[start].id , nodes[end].id);
                res.push_back(nodes[start].id);
                res.push_back(nodes[end].id);
                return res;
            }
            else if( nodes[start].val + nodes[end].val < target )
                ++start;
            else
                --end;
        }
    }
  • 相关阅读:
    metasploit 常用命令汇总
    MSF命令 收集
    【转载】虫师『性能测试』文章大汇总
    渗透测试、取证、安全和黑客的热门链接
    Hackers top in China
    国外整理的一套在线渗透测试资源合集[转载]
    Filezilla中文字符文件看不到或显示乱码的解决办法
    Filezilla 多目录的访问设置
    ISAPI在IIS7上的配置
    数据库主体在该数据库中拥有 架构,无法删除解决方法(转)
  • 原文地址:https://www.cnblogs.com/gattaca/p/4122041.html
Copyright © 2011-2022 走看看