leetcode-解题2018-4-29

1. Two Sum

code:

class Solution:
    def twoSum(self, nums, target):
        for a in range(0,len(nums)):
            for b in range(a+1,len(nums)):
                if (nums[a]+nums[b]==target):

                    return [a,b]

思路：直接暴力搜索就好，通过二层嵌套循环

2. Add Two Numbers

code:

class Solution:
    def addTwoNumbers(self, l1, l2):
        a=[]
        b=[]
        while(l1):
            a.append(str(l1.val))
            l1=l1.next
        while(l2):
            b.append(str(l2.val))
            l2=l2.next
        a.reverse()
        b.reverse()
        c=''
        d=''
        for i in a:
            c+=str(i)
        for i in b:
            d+=str(i)
        e=(int(c)+int(d))
        f=ListNode(e%10)
        n=f
        e=e//10
        while(e!=0):
            n.next=ListNode(e%10)
            n=n.next
            e=e//10
        return(f)

思路：此题利用的想法主要是指针，跟c语言的指针非常的相似

3. Longest Substring Without Repeating Characters

code：

class Solution:
    def lengthOfLongestSubstring(self, s):
        e = len(s)
        maxLenth = 0
        if(e!=0):
            n=0
            for m in range(0,e):
                if(s[m] not in s[n:m]):
                    m+=1
                else:
                    l = m-n
                    maxLenth = max(l,maxLenth)
                    n = s.find(s[m],n)+1
            maxLenth = max(m-n,maxLenth)
        return maxLenth

如上：主要思路就是每次找到遗传不重复的字符串都记录长度，然后从重复的字符继续搜索。

53. Maximum Subarray

code：

class Solution:
    def maxSubArray(self, nums):
        e = len(nums)
        maxNum = nums[0]
        thisSum = 0
        for i in range(0,e):
            thisSum+=nums[i]
            if(thisSum>maxNum):
                maxNum = thisSum
            if(thisSum < 0):
                thisSum = 0
        return maxNum

思路：利用在线处理，通过两个变量记录此时的值，和历史最大值，如果此时的值为负数则丢弃，通过O（n）的方法解决此题。

118.Pascal‘sTriangle

class Solution:
    def generate(self, numRows):
        t = []
        start = []
        s = 0
        for i in range(s,numRows):
            e = len(start)
            start1 = [1]
            for j  in range(0,e):
                if(j+1==e):
                   start1.append(1)
                else:
                    start1.append(start[j]+start[j+1])
            start = start1
            t.append(start)

        return t

思路：非常简单了，就是每次创建一个初始为空的列表，每次循环先加一个 1，然后从上个列表从左到右依次相加，最后补 1