方法一(对撞指针)
class Solution:
def twoSum(self, numbers, target):
i = 0
j = len(numbers) - 1
while i < j:
if numbers[i] + numbers[j] > target:
j -= 1
elif numbers[i] + numbers[j] == target:
return [i+1,j+1]
else:
i += 1
return []
len()#返回数组的长度
if 条件1成立
返回命令1
elif 条件2成立
返回命令2
else 条件1、2都不成立
返回命令3
i+=1自加1
i-=1自减1
while 直到条件达成否则一直循环
方法二 遍历循环
class Solution:
def twoSum(self, numbers, target):
a=len(nums)
for i in range(a):
for j in rang(i+1,a):
if numbers[i] + numbers[j] == target:
return [i+1,j+1]
return[]
range(start, stop[, step])#从star开始计数到stop停止,步长为step
1.range(4)从零到四步长为1
2.range(1,4)从一到四步长为1
3.range(1,4,2)从一到四步长为2