zoukankan      html  css  js  c++  java
  • [LeetCode] Two Sum II

    Problem Description:

    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.

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


    The idea is very simple: set two pointers, one starts from l = 0 and the other starts from r = numbers.size() - 1. If the numbers pointed by them sum to target, we are done. Otherwise, if the their sum is larger than target, we know the number pointed by r is larger and so decrease r by 1. The case is similar if their sum is smaller than target (increase l by 1).

    So we could write down the following code.

     1 class Solution {
     2 public:
     3     vector<int> twoSum(vector<int>& numbers, int target) {
     4         int n = numbers.size(), l = 0, r = n - 1;
     5         while (true) {
     6             if (numbers[l] + numbers[r] == target)
     7                 return {l + 1, r + 1};
     8             if (numbers[l] + numbers[r] > target) r--;
     9             else l++;
    10         }
    11     }
    12 };
  • 相关阅读:
    ios-app提交审核问题总结
    mui混合app请求过程处理(缓存、加载、刷新机制)
    vue引入assets和static静态资源问题
    mui入门教程
    scroll.js
    jQuery.Running.js
    CSS 编码技巧
    textillate.js
    3. 戏说VHDL之入门游戏一:流水灯
    2. 流水灯小计
  • 原文地址:https://www.cnblogs.com/jcliBlogger/p/4562235.html
Copyright © 2011-2022 走看看