题目:
解答:
1 class Solution { 2 public: 3 vector<int> twoSum(vector<int>& nums, int target) 4 { 5 // vector<int> res; 6 if (nums.size() <= 1) 7 { 8 return {}; 9 } 10 11 int left = 0; 12 int right = nums.size() - 1; 13 while (left < right) 14 { 15 if (nums[left] + nums[right] == target) 16 { 17 return {nums[left], nums[right]}; 18 break; 19 } 20 else if (nums[left] + nums[right] > target) 21 { 22 right--; 23 } 24 else 25 { 26 left++; 27 } 28 } 29 30 return {}; 31 } 32 };
原文:https://www.cnblogs.com/ocpc/p/12859699.html