SparkSnail

题目思路1.使用栈，把K个node入栈，然后按照出栈的顺序重新连接。 2.原地翻转，加一个头结点dummyNode便于操作。代码1"""Definition for singly-linked list.class ListNode: def __init__(self, x): self.val = x self.next...

题目思路快慢指针。代码# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def ...

题目思路1.拆分链表 2.后边链表就地逆置 3.merge代码# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Soluti...

题目Sort a linked list using insertion sort.思路实现了插入排序和选择排序。 不过，两段代码在一个case上都TLE了。代码1（插入排序）# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# ...

题目Sort a linked list in O(n log n) time using constant space complexity.思路链表的归并排序代码# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# sel...

题目思路复制数字即可。代码"""Definition of ListNodeclass ListNode(object): def __init__(self, val, next=None): self.val = val self.next = next"""class Solution: """ ...

题目思路递归构建左子树和右子树代码"""Definition of ListNodeclass ListNode(object): def __init__(self, val, next=None): self.val = val self.next = nextDefinition of TreeNode:clas...

题目思路归并排序，链表。代码"""Definition of ListNodeclass ListNode(object): def __init__(self, val, next=None): self.val = val self.next = next"""class Solution: """ ...

题目思路两个指针同时遍历即可。代码"""Definition of ListNodeclass ListNode(object): def __init__(self, val, next=None): self.val = val self.next = next"""class Solution: """ ...

题目思路K有大于链表长度的情况，需要取余处理。代码"""Definition for singly-linked list.class ListNode: def __init__(self, x): self.val = x self.next = None"""class Solution: """ @...

题目思路用堆栈，反向得到链表的结点。代码"""Definition of ListNodeclass ListNode(object): def __init__(self, val, next=None): self.val = val self.next = next"""class Solution: ""...

题目思路遍历，找到nodeV1和nodeV2，交换即可。 注意noveV1和nodeV2相邻的情况。代码"""Definition for singly-linked list.class ListNode: def __init__(self, x): self.val = x self.next = None"""c...

题目思路水题，遍历翻转即可。代码"""Definition of ListNodeclass ListNode(object): def __init__(self, val, next=None): self.val = val self.next = next"""class Solution: """ ...

题目思路水题代码"""Definition of ListNodeclass ListNode(object): def __init__(self, val, next=None): self.val = val self.next = next"""class Solution: """ @para...

题目思路用两个指针，记录下来nmax和pre_nmax结点，之后不断插入即可。代码"""Definition of ListNodeclass ListNode(object): def __init__(self, val, next=None): self.val = val self.next = next"""...

题目A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.思路先复制next结点，然后再复制random结点。...