leetcode[167]Two Sum II - Input array is sorted-白红宇

leetcode[167]Two Sum II - Input array is sorted

阅读量：5085 次

发布时间：2019-06-13

本文共 751 字，大约阅读时间需要 2 分钟。

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

vector
     
       twoSum(vector
      
        &numbers, int target) {    vector
       
         res;    int left=0;    int right=numbers.size()-1;    long long int sum=0;    while(left

转载于:https://www.cnblogs.com/Vae1990Silence/p/4283755.html

你可能感兴趣的文章