leetcode2sumc algLearning 算法学习及强化

leetcode 2和c算法学习及强化1.力密码101 class Solution { public: vector< int > twoSum (vector< int >& numbers, int target) { int l = 0 , r = numbers. size ()- 1 ; while (l < r) { int sum = numbers[l] + numbers[r]; if (sum == target) { return {l+ 1 , r+ 1 }; } else if (sum > target) { r--; } else if (sum < target) { l++; } } return {}; } }; class Solution { public: void merge (vector< int >& nums1, int m, vector< int >& nums2, int n) { int r1 = m - 1 , r2 = n - 1 ; int t = m + n - 1 ; while (r1 >= 0