leetcode 之 Two Sum II - Input array is sorted c++

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        int n = numbers.size();
        vector<int> result;
        int i = 0;
        for (i = 0;i<n&&numbers[i]<= target;i++){
            for (int j = i+1;j<n&&numbers[j]<=target;j++){
                if (numbers[i]+numbers[j] == target){
                    result.push_back(i+1);
                    result.push_back(j+1);
                    return result;
                }
            }
        }
        return {};
    }
};

原文地址:https://www.cnblogs.com/bingLblog/p/10654129.html

时间: 2024-08-29 18:01:29

leetcode 之 Two Sum II - Input array is sorted c++的相关文章

LeetCode 167. Two Sum II - Input array is sorted (两数之和之二 - 输入的是有序数组)

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 m

Java [Leetcode 167]Two Sum II - Input array is sorted

题目描述: 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 in

LeetCode - 167. Two Sum II - Input array is sorted - O(n) - ( C++ ) - 解题报告

1.题目大意 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 i

LeetCode 167. Two Sum II – Input array is sorted

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 m

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

给定数组排好序了,然后给一个目标,找到两个数相加等于目标的两个数的下标. 蛮简单感觉,就是左右两边往里,比目标大就右边减,小就左边加.一样就输出. vector<int> twoSum(vector<int> &numbers, int target){ vector<int> ans; int left = 1, right = numbers.size(); while(left < right){ if (numbers[left-1] + numb

LeetCode 167. Two Sum II - Input array is sorted(双指针)

题目 题意:找出数组里两个数字之和为指定数字的两个下标. 题解:双指针 class Solution { public: vector<int> twoSum(vector<int>& numbers, int target) { int left = 0; int right = numbers.size()-1; vector<int> ans; while(left < right) { if(numbers[left]+numbers[right]

【LeetCode】167. Two Sum II - Input array is sorted

Two Sum II - Input array is sorted 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 a

Two Sum II - Input array is sorted(leetcode167) - Solution2

Q: 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 index

Two Sum II - Input array is sorted(leetcode167) - Solution1

Q: 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 index