购物车内的商品价格按照升序记录于数组 price。请在购物车中找到两个商品的价格总和刚好是 target。若存在多种情况,返回任一结果即可。
示例 1:
输入:price = [3, 9, 12, 15], target = 18
输出:[3,15] 或者 [15,3]
示例 2:
输入:price = [8, 21, 27, 34, 52, 66], target = 61
输出:[27,34] 或者 [34,27]
提示:
1 <= price.length <= 10^5
1 <= price[i] <= 10^6
1 <= target <= 2*10^6
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/he-wei-sde-liang-ge-shu-zi-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
public class Solution {
public int[] TwoSum(int[] price, int target) {
int left = 0;
int right = price.Length-1;
int[] inter = new int[2];
while(left<right){
if(price[left]+price[right]>target) right--;
else if(price[left]+price[right]<target) left++;
else{
inter[0] = price[left];
inter[1] = price[right];
return inter;
}
}
return inter;
}
}