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.
    
    Input: numbers={2, 7, 11, 15}, target=9
    Output: index1=1, index2=2

    没什么说的,two pointer做法。这道题应该是元素没有重复的,因为它必须要ganrantee只有一个solution

     1 public class Solution {  
     2     public int[] twoSum(int[] numbers, int target) {  
     3         int l = 0;
     4         int r = number.length - 1;
     5         int[] res = new int[2];
     6         while (l <= r) {
     7             if (numbers[l] + numbers[r] == target) {
     8                 res[0] = l + 1;
     9                 res[1] = r + 1;
    10                 break;
    11             }
    12             else if (numbers[l] + numbers[r] < target) {
    13                 l++;
    14             }
    15             else r--;
    16         }
    17         return res;
    18     }
    19 }
  • 相关阅读:
    根据第三方库spire.pdf使用指定打印机打印pdf文件
    大批量GPS坐标转百度坐标
    maven settings.xml
    linux 权限
    hyper-v 创建ubuntu虚拟机设置静态ip
    mysql 复制
    nginx
    python函数定义
    Mysql索引浅析
    Mysql 数据库锁机制浅析
  • 原文地址:https://www.cnblogs.com/EdwardLiu/p/4252490.html
Copyright © 2011-2022 走看看