Practice-Leetcode/Sorted2Sum.cpp at master · adilhamid/Practice-Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        int len = numbers.size();
        if(len<=1) return {};

        auto lower = upper_bound(numbers.begin(), numbers.end(), target);
        int end_pointer;
        if(lower == numbers.end())
            end_pointer = lower - numbers.begin()-1;
        else
          end_pointer = lower - numbers.begin();

        int start_pointer = 0;

        while(start_pointer < end_pointer){

            if(numbers[start_pointer] + numbers[end_pointer] < target){
                start_pointer++;
            }
            else if(numbers[start_pointer] + numbers[end_pointer] > target){
                end_pointer--;
            }

            else{
                break;
            }

        }

        vector<int>result(2);
        result[0]= start_pointer+1;
        result[1]= end_pointer+1;
        return result;

    }

};