两数之和 - update

最新推荐文章于 2024-01-19 21:07:14 发布

sinat_15355869

最新推荐文章于 2024-01-19 21:07:14 发布

阅读量105

点赞数

分类专栏：基础算法

本文链接：https://blog.csdn.net/sinat_15355869/article/details/98459654

版权

基础算法专栏收录该内容

65 篇文章 0 订阅

订阅专栏

题目&代码：

# @TIME : 2019/8/4 下午12:19
# @File : 两数之和.py
import time

"""
nums = [2, 7, 11, 15]
target = 9

return [0, 1] index
"""


nums = [2, 7, 11, 15]
target = 13

# 方法一：
def twosum1(nums, target):
    """暴力方法: O(n^2)"""
    for i in range(len(nums)-1):
        for j in range(i+1, len(nums)):
            if nums[i] + nums[j] == target:
                return [i, j]

s1 = time.time()
answ = twosum1(nums, target)
e1 = time.time()
print(answ)
print("time:",e1 - s1)


# 方法二：
def twosum2(nums, target):
    """用一次循环 + for的同时在list后部查找, 有可能最差情况sec_num的在最后那复杂度是O(n)"""
    for i in range(len(nums) - 1):
        sec_num = target - nums[i]
        if sec_num in nums[i:]:
            sec_indx = nums[i:].index(sec_num)
            a = 1
            return [i, sec_indx + i]

print('*'*20)
s1 = time.time()
answ = twosum2(nums, target)
e1 = time.time()
print(answ)
print("time:",e1 - s1)


# 方法三:
def twosum3(nums, target):
    """使用哈希表存储 -> map -> dict"""
    mapping = dict()
    for i in range(len(nums)):
        sec_num = target - nums[i]
        if sec_num in mapping:
            return [mapping[sec_num], i]
        else:
            mapping[nums[i]] = i


print('*'*20)
s1 = time.time()
answ = twosum3(nums, target)
e1 = time.time()
print(answ)
print("time:",e1 - s1)



# 方法四：
def binary_search(nums, target):
    l = 0
    r = len(nums)-1
    while l <= r:
        mid = int((l + r) / 2)
        if target == nums[mid]:
            return mid
        elif target < nums[mid]:
            r = mid -1
        elif target > nums[mid]:
            l = mid + 1
    return -1

def twosum4(nums, target):
    """使用 切片后的二分查找 代替哈希，或者是list后半部分切片查找"""
    for i in range(len(nums)):
        sec_num = target - nums[i]
        binary_idx = binary_search(nums[i:], sec_num)
        if binary_idx != -1:
            return [i, binary_idx+i]


print('*'*20)
s1 = time.time()
answ = twosum4(nums, target)
e1 = time.time()
print(answ)
print("time:",e1 - s1)

结果：
[0, 2]
time: 9.059906005859375e-06  [最慢]  -> 两层for 循环 
********************
[0, 2]
time: 5.0067901611328125e-06 [倒数第二] -> for & 同时用list.index查找
********************
[0, 2]
time: 3.0994415283203125e-06  [最快] -> for & 同时用hash mapping dict查找
********************
[0, 2]
time: 2.193450927734375e-05  [倒数] -> 只不过是第二种的升级版，第二种是遍历查找，这里是二分查找  -》LeetCode 167(这种方法需要nums先排好序)