203.移除链表元素
题目链接:203.移除链表元素
- 设置虚拟头节点dummy,可以避免单独讨论特殊情况
- 要删除一个结点,其实需要保留的是前一个结点,所以cur指向的是待处理结点的前一个
class Solution(object):
def removeElements(self, head, val):
"""
:type head: ListNode
:type val: int
:rtype: ListNode
"""
dummy=ListNode()
dummy.next=head
cur=dummy
while cur.next:
if cur.next.val==val:
cur.next=cur.next.next
else:
cur=cur.next
return dummy.next
707.设计链表
题目链接:707.设计链表
- 如何自己定义ListNode类
- 注意range的范围
- 需要单独设置self.size,并在相应的函数中增加或减少它的值
class ListNode():
def __init__(self,val=0,next=None):
self.next=next
self.val=val
class MyLinkedList(object):
def __init__(self):
self.size=0
self.dummy=ListNode()
def get(self, index):
"""
:type index: int
:rtype: int
"""
if index<0 or index>=self.size:
return -1
cur=self.dummy
for i in range(index+1):
cur=cur.next
return cur.val
def addAtHead(self, val):
"""
:type val: int
:rtype: None
"""
self.dummy.next=ListNode(val,self.dummy.next)
self.size+=1
def addAtTail(self, val):
"""
:type val: int
:rtype: None
"""
cur=self.dummy
while cur.next:
cur=cur.next
cur.next=ListNode(val)
self.size+=1
def addAtIndex(self, index, val):
"""
:type index: int
:type val: int
:rtype: None
"""
if index>self.size or index<0:
return
cur=self.dummy
for i in range(index):
cur=cur.next
cur.next=ListNode(val,cur.next)
self.size+=1
def deleteAtIndex(self, index):
"""
:type index: int
:rtype: None
"""
if index<0 or index>=self.size:
return
cur=self.dummy
for i in range(index):
cur=cur.next
cur.next=cur.next.next
self.size-=1
206.反转链表
题目链接:206.反转链表
- 双指针法:逐个反转
class Solution(object):
def reverseList(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
cur = head
pre = None
while cur:
temp = cur.next # 保存一下 cur的下一个节点,因为接下来要改变cur->next
cur.next = pre #反转
#更新pre、cur指针
pre = cur
cur = temp
return pre
时间复杂度:O(n)
空间复杂度:O(1)
- 递归法
class Solution:
def reverseList(self, head: ListNode) -> ListNode:
return self.reverse(head, None)
def reverse(self, cur: ListNode, pre: ListNode) -> ListNode:
if cur == None:
return pre
temp = cur.next
cur.next = pre
return self.reverse(temp, cur)
时间复杂度:O(n)
空间复杂度:O(n)