剑指 Offer57.和为s的两个数字

题目描述

 

 解法 

双指针

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

 

参考：https://leetcode.cn/problems/he-wei-sde-liang-ge-shu-zi-lcof/solution/jian-zhi-offerlian-xi-c-t32-by-zealous-g-eu1c/