2017-8-31 python two sum 问题

发表于 | 更新于 | 分类于 ， | 评论数： | 阅读次数：
本文字数： 3.5k | 阅读时长 ≈ 3 分钟

题目描述：

来自LeetCode

1
2
3
4
5
6
7
8
9
10
11
12
13
# Time:  O(n)
# Space: O(n)

# Given an array of integers, return indices of the two numbers
# such that they add up to a specific target.
#
# You may assume that each input would have exactly one solution.
#
# Example:
# Given nums = [2, 7, 11, 15], target = 9,
#
# Because nums[0] + nums[1] = 2 + 7 = 9,
# return [0, 1].
阅读全文 »