LeetCode(1) Two Sum
2017-07-13 23:21
519 查看
问题定义:给定一个数组nums和一个正整数target,在数组中找出两个数(一定存在)使两个数之和等于target。
思路:用Hash表建立方向索引
时间复杂度:O(n)
注意点:id2!=id
思路:用Hash表建立方向索引
时间复杂度:O(n)
注意点:id2!=id
class Solution: def twoSum(self, nums, target): dict={} for id,num in enumerate(nums): dict[target-num]=id for id,num in enumerate(nums): id2=dict.get(num) if id2 is not None and id2!=id: return [id,dict[num]]
相关文章推荐
- Leetcode第一题--------- Two Sum
- leetcode----Two Sum
- LeetCode 1. Two Sum
- leetcode01 Two Sum 寻找列表中和为定值的元素位置
- [LeetCode]Two Sum
- LeetCode - 1. Two Sum
- LeetCode--Two Sum
- 【Leetcode】【Python】【C++】1. Two Sum实现
- LeetCode-1:Two Sum
- 【一天一道LeetCode】 #1 Two Sum
- leetcode—Two Sum
- LeetCode Two Sum(C/JS)
- [leetcode NO.1] Two Sum (JAVA)
- LeetCode 1. Two Sum
- [LeetCode]1. Two Sum
- leetcode python - Two Sum
- 【leetcode】1. Two Sum
- 【LeetCode】1 Two Sum
- LeetCode算法问题9 —— Two Sum
- 【Leetcode】1. Two Sum