LeetCode #1

class Solution:
    def twoSum(self, nums, target):

        k = 0

#In fact, there is two loops which are used to find two numbers whose sum is target.

        for i in nums:
            j = target - i
            k += 1
            tmp_nums = nums[k:]
            if j in tmp_nums:
                return [k - 1, tmp_nums.index(j) + k]   #return the answer