zoukankan      html  css  js  c++  java
  • (leetcode题解)Two Sum II

    Given an array of integers that is already sorted in ascending order, 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 and you may not use the same element twice.

    Input: numbers={2, 7, 11, 15}, target=9
    Output: index1=1, index2=2

    题意是给定一个排好序的数组,找出两数之和等于target的位置。

    既然知道其中一个数,找另一个数存不存在,我立刻想到用哈希表来实现查找比较快捷,找到之后定位就好了。C++实现如下:

    vector<int> twoSum(vector<int>& numbers, int target) {
            unordered_map<int,int> hash_map;
            vector<int> res;
            for(auto &i:numbers)
                hash_map[i]++;
            int temp;
            int j=0;
            for(auto &i:numbers)
            {
                if(hash_map[target-i])
                {
                    res.push_back(j+1);
                    temp=target-i;
                    break;
                }
                j++;
            }
            for(int i=j+1;i<numbers.size();i++)
                if(temp==numbers[i])
                    res.push_back(i+1);
            return res;
    }

    参考网上,另一种解法我觉得也挺不错的,即用双指针,一个指向数组头,一个指向数组尾,通过移动两个指针在实现查找,因为数组本身是排好序的,所以这个是可以完美实现的。C++实现如下,以做参考:

    vector<int> twoSum(vector<int>& numbers, int target) {
            int l = 0, r = numbers.size() - 1;
            while (l < r) {
                int sum = numbers[l] + numbers[r];
                if (sum == target) 
                    return {l + 1, r + 1};
                else if (sum < target) 
                    ++l;
                else 
                    --r;
            }
            return {};
        }
  • 相关阅读:
    Inno Setup新建项目
    Modal实现页面跳转和控制器数据传递
    Asp.net Web Api添加异常筛选器
    Inno Setup添加中文安装语言文件
    ubuntu 自动获取IP
    JavaScript 语言基础知识点总结(思维导图)
    自己整理的部分腾讯web前端开发的笔试题目及答案
    spry可折叠面板
    131变化两边,固定中间的布局
    HTML中的dl、dt和dd标记
  • 原文地址:https://www.cnblogs.com/kiplove/p/6986738.html
Copyright © 2011-2022 走看看