python--两数之和的相关题目

1.给定一个列表和一个整数，设计算法找到两个数的下标，使得两个数之和为给定的整数。保证肯定仅有一个结果。

n例:列表[1,2,5,4]与目标整数3，1+2=3，结果为(0, 1).

li = [1,3,6,9,13,18,21,26,33]
target = 31
# 方法一
def two_sum_1(li, target):
    for i in range(len(li)):
        for j in range(i+1, len(li)):
            if li[i] + li[j] == target:
                return i, j
    return -1,-1

# 方法二
def two_sum_2(li, target):
    def binary_search(li, val, low, high):
        while low <= high:  # 只要候选区有值
            mid = (low + high) // 2
            if val == li[mid]:
                return mid
            elif val < li[mid]:
                high = mid - 1
            else:  # val > li[mid]
                low = mid + 1
        return -1

    for i in range(len(li)):
        a = li[i]
        b = target - a
        j = binary_search(li, b, i+1, len(li)-1)
        if j >= 0:
            return i, j
    return -1,-1

2.题1中的列表改为有序列表-

def two_sum_3(li, target):
    i = 0
    j = len(li)-1
    while i < j:
        x = li[i] + li[j]
        if x < target:
            i += 1
        elif x > target:
            j -= 1
        else:
            return i, j
    return -1,-1

第二种：

# O(n) 需要空间复杂度
def two_sum_4(li, target):
    dic = {}
    for i in range(len(li)):
        a = li[i]
        b = target - a
        if b in dic:
            return dic[b], i
        else:
            dic[a] = i

3.找出有序数组中加和等于sum的所有元素对，每个元素（下标来唯一标识）只能用一次。

eg1：

      a = [1, 1, 3, 4, 5, 7, 9, 11]

      result=[(1, 7), (3, 5)]

eg2:

      b = [1, 1, 3, 4, 5, 7, 7, 9, 11]

      result=[(1, 7), (1, 7), (3, 5)]

def two_sum(li, target):
    index_list = []
    result = []
    for i in range(len(li)):
        j = len(li) - 1
        while i < j:
            x = li[i] + li[j]
            if x < target:
                i += 1
            elif x > target:
                j -= 1
            else:
                if i not in index_list and j not in index_list:
                    index_list.append(i)
                    index_list.append(j)
                elif i in index_list :
                    i += 1
                else:
                    j -= 1
    for i in range(len(index_list)):
        if i % 2==0:
            result.append((li[index_list[i]], li[index_list[i + 1]]))
    return result


a = [1, 1, 3, 4, 5, 7, 9, 11]
b = [1, 1, 3, 4, 5, 7, 7, 9, 11]
print(two_sum(a, 8))
print(two_sum(b, 8))