【Lifeissohard】Leetcode #1. Two Sum

Description

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, and you may not use the same element twice.
Example

Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

Accepted python code

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        nu = 0
        for i in nums:
            try:
                num = nums.index(target - i,nu + 1)
                return [nu, num]
            except:
                nu = nu + 1
                continue

改进

1. To use the index function of list to find the index of the specific value is feasible but inefficient

str.index(str, beg = 0 end = len(string))

Parameters
str − This specifies the string to be searched.
beg − This is the starting index, by default its 0.
end − This is the ending index, by default its equal to the length of the string.

2. If the specific value is not in the list, there is a error, so, a must to use “try, except”.

try:
	num = nums.index(target - i,nu + 1)
    return [nu, num]
except:
	nu = nu + 1
	continue

A improved python code

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        h = {}     # h is a dictionary
        for i, n in enumerate(nums):   
        # i is the index, n is the number
            num = target - nums[i]
            if num not in h:
                h[n] = i     # n is the key, i is the number
            else:
                return [h[num], i]

dictionary is better for finding a number

seq = [‘one’, ‘two’, ‘three’]
for i, element in enumerate(seq):
… print i, element
…

0 one
1 two
2 three