leecode 2\4\5

leecode 2\4\5

2 两数相加

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
        res = 0
        carry = 0
        res = ListNode()
        r = res
        while l1 or l2:
            l1_val = l1.val if l1 else 0
            l2_val = l2.val if l2 else 0
            sum_ = l1_val + l2_val +carry
            
            if sum_ >=10:
                sum_ %= 10
                carry = 1
            else:
                carry = 0

            r.next = ListNode(sum_)
            r = r.next
            
            l1 = l1.next if l1 else None
            l2 = l2.next if l2 else None

        if carry == 1:
            r.next = ListNode(carry)

        return res.next

4 寻找两个正序数组中位数

class Solution:
    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
        i,j = 0,0
        l1 = len(nums1)
        l2 = len(nums2)
        if l1==0 and l2== 0:
            return 0
        merge = list()
        while i<l1 and j<l2:
            if nums1[i] <= nums2[j]:
                merge.append(nums1[i])
                i += 1
            else:
                merge.append(nums2[j])
                j += 1
        merge = merge + nums1[i:]
        merge = merge + nums2[j:]

        m = len(merge)
        if m % 2 != 0:
            return merge[m//2]
        else:
            idx = m//2
            return (merge[idx] + merge[idx - 1])/2

5 最长回文字串

# 中心扩散法
# 可能有两种情况，一种是回文串长度是奇数，中心只有一个数，一种是回文串长度是偶数，中心有两个数
class Solution:
    def longestPalindrome(self, s: str) -> str:
        n = len(s)
        res = ""
        for i in range(n):
            odd_pan, odd_len = self.panlidrome(s,i,i)
            even_pan,even_len = self.panlidrome(s,i,i+1)

            
            max_pan = odd_pan if odd_len > even_len else even_pan
            res = max_pan if len(max_pan) > len(res) else res
        
        return res
        
    def panlidrome(self,s,l,r):
        while l>=0 and r<len(s) and s[l] == s[r]:
            l -= 1
            r += 1
        return s[l+1:r], r-l-1