[Leetcode]Two Sum
来源:互联网 发布:ios app新闻项目源码 编辑:程序博客网 时间:2024/06/04 19:47
Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.
You may assume that each input would have exactly one solution.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
给定一个数组,找到其中两个数的index,这两个数相加等于目标值~ 可以用Hash Table做,如果num[i]不在哈希表里,则把target - num[i]写入哈希表里,如果num[i]在哈希表里,则直接返回(dict[num[i]], i + 1)~时间复杂度,空间复杂度都为O(N)~
class Solution: # @return a tuple, (index1, index2) def twoSum(self, num, target): if num is None or len(num) < 2: return None dict = {} for i in xrange(len(num)): if num[i] not in dict: dict[target - num[i]] = i + 1 else: return (dict[num[i]], i + 1)
0 0
- 【Leetcode】Two Sum (Sum)
- LeetCode: Two Sum
- LeetCode: Two Sum
- [Leetcode] Two Sum
- LeetCode : Two Sum
- Leetcode: Two Sum
- leetcode 46: Two Sum
- [LeetCode] Two Sum
- LeetCode 1 - Two Sum
- Leetcode : Two Sum
- 【leetcode】Two Sum
- [LeetCode]Two Sum
- leetcode Two Sum
- [Leetcode] Two Sum
- [leetcode] Two Sum
- LeetCode - Two Sum
- leetcode之Two Sum
- LeetCode | Two Sum
- PHP写入文件用file_put_contents代替fwrite优点多多
- 2015-1-13感
- IEEE802.11协议介绍
- 比cacti更好的linux单机监控——Monitorix的安装与配置
- openSession和getCurrentSession的一些注意事项
- [Leetcode]Two Sum
- __cdecl __fastcall与 __stdcall
- Python 多进程锁multiprocess Lock
- error LNK2026: 模块对于 SAFESEH 映像是不安全的
- java 抽象类和接口学习中的2个小心得
- DPDK
- NDK-error: 'dynamic_cast' not permitted with -fno-rtti
- [Leetcode] 4 - Median of Two Sorted Arrays
- makefile编译一个目录下的文件