Two Sum & Add Two Numbers

最新推荐文章于 2023-03-28 11:12:42 发布

__Ritchie__

最新推荐文章于 2023-03-28 11:12:42 发布

阅读量230

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/ritchiewang/article/details/50234771

版权

leetcode 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Two Sum

题目：https://leetcode.com/problems/two-sum/

class Solution(object):
    def twoSum(self, nums, target):  
        map = {}
        for index, value in enumerate(nums):
            if target - value in map:
                return [map[target - value] + 1, index + 1]
            map[value] = index

Add Two Numbers

题目：https://leetcode.com/problems/add-two-numbers/

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        flag = 0
        head = ListNode(0)
        pos = head
        while l1 is not None and l2 is not None:
            l3 = ListNode(l1.val + l2.val + flag)
            flag = 0
            if l3.val >= 10:
                l3.val -= 10
                flag = 1
            l1 = l1.next
            l2 = l2.next
            pos.next = l3
            pos = pos.next
        while l1 is not None:
            l3 = ListNode(l1.val + flag)
            flag = 0
            if l3.val >= 10:
                l3.val -= 10
                flag = 1
            l1 = l1.next
            pos.next = l3
            pos = pos.next
        while l2 is not None:
            l3 = ListNode(l2.val + flag)
            flag = 0
            if l3.val >= 10:
                l3.val -= 10
                flag = 1
            l2 = l2.next
            pos.next = l3
            pos = pos.next
        if flag == 1:
            l3 = ListNode(1)
            pos.next = l3
        return head.next