leetcode:LCR 179. 查找总价格为目标值的两个商品(python3解法)
难度:简单
购物车内的商品价格按照升序记录于数组
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
题解:(双指针法)
class Solution: def twoSum(self, price: List[int], target: int) -> List[int]: left, right = 0, len(price) - 1 while left < right: if price[left] + price[right] == target: return [price[left],price[right]] elif price[left] + price[right] < target: left += 1 else: right -= 1 return []