class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target)
{
int j = nums.size() - 1;
for(int i = 0; i < nums.size() - 1; i++)
{
while(nums[i] + nums[j] > target)//j一直往前走即可
j--;
if(nums[i] + nums[j] == target)
return vector<int>{nums[i], nums[j]};
}
return vector<int>{-1, -1};
}
};