思路一: 双指针,从数组左右两边开始依次查找
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
int i = 0, j = nums.size()-1;
while(i < j)
{
if(nums[i] + nums[j] == target) return vector<int>{nums[i], nums[j]};
else if(nums[i] + nums[j] > target) j--;
else i++;
}
return vector<int>{};
}
};