zoukankan      html  css  js  c++  java
  • LeetCode 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

    题意:给你一个数组,告诉你有唯一解是两个数相加等于target,求下标各自是多少

    思路:map离散储存,相对简单的一道题

    class Solution {
    public:
        vector<int> twoSum(vector<int> &numbers, int target) {
            vector<int> ans;
            map<int, int> mp;
            for (int i = 0; i < numbers.size(); i++) {
                int tmp = target - numbers[i];
                if (mp.find(tmp) != mp.end()) {
                    ans.push_back(mp[tmp]);
                    ans.push_back(i+1);
                }
                else mp[numbers[i]] = i+1;
            }
            return ans;
        }
    };


  • 相关阅读:
    o9.17,习题
    09.17,二维数组,地图
    09.15,一维数组,冒泡排序
    09.11 小兔 成兔问题
    09.01,学习习题
    FTPHelper
    Wpf发送接收 win32消息
    win32Helper
    xml 封装类
    C# 多进程安全
  • 原文地址:https://www.cnblogs.com/wzzkaifa/p/7359704.html
Copyright © 2011-2022 走看看