34.leetcode15&5_time_limit_exceeded

做的这两道题，到现在还没通过，只好先放一下了。-_-||

5题代码：

class Solution(object):
    def longestPalindrome(self, s):
        """
        :type s: str
        :rtype: str
        """
        temp=[]
        list1=list(s)
        l=len(list1)
        list2=list1[0:1]
        l2=0
        if l==0:
            return ""
        if l==1:
            return s
        else:
            i=1
            while i<2*l:
                list1.insert(i,'@')
                i+=2
        l=len(list1)
        i=1
        while i<l:
            j=0
            while j<=i and i+j<l:
                if list1[i-j]==list1[i+j]:
                    temp=list1[i-j:i+j+1]
                    j+=1
                else:
                    break
            if len(temp)>l2:
                list2=temp
                l2=len(list2)
            i+=1
        result=""
        for i in list2:
            if i!="@":
                result+=i
        return result

15题代码：

class Solution(object):
    def threeSum(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        result=[]
        temp=[]
        nums.sort()
        i=0
        l=len(nums)
        while i<l-2:
            left=i+1
            right=l-1
            if nums[i]>0 or nums[right]<0:
                break
            while left<right and nums[left]+nums[i]<=0 and nums[right]>=0:
                s=nums[i]+nums[left]+nums[right]
                if s==0 and [nums[i],nums[left],nums[right]] not in result:
                    temp=[nums[i],nums[left],nums[right]]
                    result.append(temp)
                    left+=1
                    right-=1
                elif s>0:
                    right-=1
                else:
                    left+=1
            i+=1
        return result