LeetCode刷题笔记-1

写在开端：

       几个月前用Python刷了几十道题，后来因为别的事停止了，现在想继续刷，考虑到Python的功能太强大并且Java在企业中用的也比较多，后续都用Java来刷，希望能提高自己的代码能力。原则上是按照序号刷，但如果某一类题想集中训练也会跳刷，对每道题做一个记录，提升自己的信心。

LeetCode-1.Two Sum（Easy）：

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].

我的做法： 

#!/usr/bin/python
# -*- coding: UTF-8 -*-

class Solution:
    def twoSum(self,nums,target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        ans = []
        for i in range(0,len(nums)):
            #i = int(i)
            for j in range(i+1,len(nums)):
                #j = int(j)
                if (nums[i] + nums[j] == target):
                    return [i,j]