Two|Two Sum II - Input array is sorted
1.传统做法是两个指针同时移动，这样的话时间复杂度是o(n)
class Solution(object):
def twoSum(self, numbers, target):
"""
:type numbers: List[int]
:type target: int
:rtype: List[int]
"""
left = 0
right = len(numbers) - 1
while left < right :
if numbers[left] + numbers[right] == target:
return [left+1, right+1]
elif numbers[left] + numbers[right] < target:
left += 1
else:
right -= 1
【Two|Two Sum II - Input array is sorted】2.用字典记录下每个number 边记录边判断
···
class Solution(object):
def twoSum(self, numbers, target):
"""
:type numbers: List[int]
:type target: int
:rtype: List[int]
"""
dic = {}
for i,num in enumerate(numbers):
if (target - num) in dic:
return [dic[target - num], i+1]
else:
dic[num] = i+1
···推荐阅读
- 【Leetcode/Python】001-Two|【Leetcode/Python】001-Two Sum
- 推荐系统论文进阶|CTR预估 论文精读(十一)--Deep Interest Evolution Network(DIEN)
- NAT（网络地址转换技术）
- KubeDL HostNetwork（加速分布式训练通信效率）
- 清晨朗读327（How|清晨朗读327：How Successful People Network with Each Other）
- 神经网络Neural|神经网络Neural Networks
- 8-31|8-31 老Eastwood《骡子》
- AFNetworking上传图片
- 29th|29th May Learning summary of Blockchain
- 论文笔记|【论文笔记】DIEN: Deep Interest Evolution Network for Click-Through Rate Prediction