LeetCode

1.Tow 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, 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].

Mycode:

class Solution:
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        result = []
        for i in range(0,len(nums)-1):
            temp_num1 = nums[i]
            for j in range(i+1, len(nums)):
                temp_num2 = nums[j]
                temp = temp_num1 + temp_num2

                if temp == target:
                    result.append(i)
                    result.append(j)
                    break
        return result

第一次刷题，结果第19个测试用例没跑过，算法超时了！该问题有待解决，希望读这篇博客的人可以共同讨论一下。