leetcode Two Sum ----python3

看完网上的想法自己写出来的，也算抄了一下把

class Solution:
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        key_list = []
        value_list =[]
        lens = len(nums)
        for i in range(lens):
            key_list.append(i)
            value_list.append(nums[i])
            
            n = target - nums[i]
            try:
                j = value_list.index(n)
                if j is not None and j<i:
                    return[i,j]
            except ValueError as err:
                pass