leetcode第一、二题

最新推荐文章于 2024-09-15 15:43:59 发布

夜_树懒

最新推荐文章于 2024-09-15 15:43:59 发布

阅读量86

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/canmang1/article/details/109001349

版权

leetcode 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

#leetcode第一题
class Solution:    
	def twoSum(self, nums: List[int], target: int) -> List[int]:        
	dct = {}        
	for i, n in enumerate(nums):            
		cp = target - n            
		if cp in dct:                
			return [dct[cp], i]           
		else:
			dct[n] = i

#leetcode第二题
#方法1
# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
def jisuan(l):
    sum1=0
    b=1
    while l is not None:
        sum1+=b*l.val
        b*=10
        l=l.next
    return sum1
class Solution:
    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
        res= str(jisuan(l1)+jisuan(l2))
        next_node=None
        for i in res:
            next_node=ListNode(int(i),next_node)
        return next_node
#法2
#>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>


class Solution:

    def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
        r=ListNode(0)
        carry=0
        re=r
        while (l1 or l2):
            x=l1.val if l1 else 0
            y=l2.val if l2 else 0
            s=x+y+carry
            re.next=ListNode(s%10)
            carry=s//10
            re=re.next
            if l1!=None:     l1=l1.next 
            if l2!=None:     l2=l2.next  
        if (carry>0):
            re.next=ListNode(1)
        while r.next:
            return r.next
``