LeetCode----1. Two Sum
2016-10-17 13:26
274 查看
1. Two Sum
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].
UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.ANSWER:
class Solution(object): def twoSum(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ dict = {} for i in range(len(nums)): x = nums[i] if target - x in dict: return (dict[target - x], i) dict[x] = i
相关文章推荐
- LeetCode解题笔记1 Two Sum
- [Leetcode]1 Two Sum
- [LeetCode]1. Two Sum
- LeetCode 1_Two Sum
- LeetCode(1) Two Sum
- leetcode 1 Two Sum
- Leetcode 1:Two Sum
- leetcode 1. Two Sum
- [LeetCode][Java] Two Sum
- [leetcode]1.Two Sum
- LeetCode1—Two Sum
- {LeetCode} 1. Two Sum
- 【leetcode 001】Two Sum || Add Two Numbers
- LeetCode-1. Two Sum
- [LeetCode] Two Sum, Solution
- 【LeetCode】Two Sum
- LeetCode 1. Two Sum
- LeetCode --Two Sum
- 【LeetCode解题一】Two Sum问题Java解答
- Two Sum - LeetCode 1