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

     1 class Solution {
     2 public:
     3     vector<int> twoSum(vector<int>& numbers, int target) {
     4         vector<int> indexes;
     5         if (numbers.size() < 2) return indexes;
     6         
     7         int left = 0, right = numbers.size() - 1;
     8         while (left < right) {
     9             if (numbers[left] + numbers[right] > target)
    10                 right--;
    11             else if (numbers[left] + numbers[right] < target)
    12                 left++;
    13             else {
    14                 indexes.push_back(left + 1);
    15                 indexes.push_back(right + 1);
    16                 break;
    17             }
    18         }
    19         return indexes;
    20     }
    21 };
  • 相关阅读:
    python count函数
    kubenetes服务发现
    k8s网络
    k8s创建pod流程
    openstack创建虚拟流程、各组件介绍
    生产者消费者问题
    Date类和Calendar类
    Timer定时器
    Java中的克隆
    注解
  • 原文地址:https://www.cnblogs.com/amazingzoe/p/5883689.html
Copyright © 2011-2022 走看看