本文共 879 字，大约阅读时间需要 2 分钟。

# 反转链表class Node:    def __init__(self,data=None,nod=None):        self.data = data        self.next = nod        def rev(link):    pre = link    cur = link.next    pre.next = None    while cur:        temp  = cur.next        cur.next = pre        pre = cur        cur = temp    return preif __name__ == '__main__':    link = Node(1,Node(2,Node(3,Node(4,Node(5,Node(6,Node(7,Node(8,Node(9)))))))))    print(link.data)    print(link.next.data)    root = rev(link)    while root:        print(root.data,end=' ')        root=root.next#     print(link.data)

# Two Sum 给定一个列表和目标值，找出列表里面两个数使得相加为目标值class Solution:    def twoSum(self,nums,target):        """        :type nums: List[int]        :type target: int        :rtype: List[int]        """        d = {}        size = 0        while size < len(nums):            if target-nums[size] in d:                if d[target-nums[size]] 

转载地址：https://blog.csdn.net/zz2230633069/article/details/102520179 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！