Leetcode167（力扣167）：两数之和II

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        int p1=0,p2=numbers.size()-1;
        int sum=0;
        while(p1!=p2) {
            sum=numbers[p1]+numbers[p2];
            if(sum>target) {
                p2--;
            }
            else if(sum<target) {
                p1++;
            }
            else return {p1+1,p2+1};
        }
        return {};
    }
};