Leetcode167 - sum of two numbers II - double pointer - bisection - array - Search

Original link

Note：

Enumerate each location , Then set a position and go to two points to find the next position
I wanted to make a judgment , See if the first number has exceeded target You don't have to change it , It turns out that there will be negative numbers , It's not easy to add , Don't prune at all

The code is as follows ：

class Solution {
    
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
    
        for(int i = 0; i < numbers.size() - 1; i ++){
    
            int l = i + 1, r = numbers.size() - 1;
            while(l < r){
    
                int mid = l + r + 1 >> 1;
                if(numbers[i] + numbers[mid] <= target) l = mid;
                else r = mid - 1;
            }
            if(numbers[i] + numbers[l] == target)   return {
    i + 1, l + 1};
        }
        return {
    };
    }
};