目录
Leetcode203
题目:移除链表元素
学习资料:代码随想录
初始思路:
- 按照基本的删除节点思路;head节点比较特殊,所以要引用虚拟节点。
学习后:
- 题目较为简单,思路基本一致
实现过程:
- 注意虚拟节点如何定义
- 注意如果值不相等时候再移动cur指针
- leetcode给好了结构,实现起来非常简单,但是面试时候基本都是acm模式,所以要清楚链表结构如何定义,如何打印输出,类似练习见下题。
class ListNode:
def __init__(self, val=0, next=None):
self.val = val
self.next = next
def removeElements(head, val):
dummy = ListNode(next=head)
cur = dummy
while cur.next!=None:
if cur.next.val == val:
cur.next = cur.next.next
else:
cur = cur.next
return dummy.next
#以下仅为acm模式练习
l = [1,2,6,3,4,5,6]
head = ListNode(l[0])
p = head
for i in l[1:]:
node = ListNode(i)
p.next = node
p = p.next
val = 6
b = removeElements(head, val)
while b!=None:
print(b.val)
b = b.next
Leetcode707
题目:设计链表
学习:代码随想录
初始思路:
- 一步一步实现,得慢慢思考,很多细节容易出错
学习后:
- 引入虚拟节点
- 在头部插入和尾部插入都可以用atindex来做
- 注意self.count的定义,初始定义为0,那么判断的时候index等于self.count也非法
class ListNode:
def __init__(self,val=0,next=None):
self.val = val
self.next = next
class MyLinkedList:
def __init__(self):
self.head = ListNode(0)
self.count = 0
def get(self, index: int) -> int:
if index < 0 or index >= self.count:
return -1
cur = self.head
for _ in range(index):
cur = cur.next
return cur.next.val
def addAtHead(self, val: int) -> None:
return self.addAtIndex(0,val)
def addAtTail(self, val: int) -> None:
return self.addAtIndex(self.count,val)
def addAtIndex(self, index: int, val: int) -> None:
if index < 0:
index = 0
elif index > self.count:
return
self.count += 1
node = ListNode(val)
pre, cur = self.head, node
for _ in range(index):
pre = pre.next
cur.next = pre.next
pre.next = cur
def deleteAtIndex(self, index: int) -> None:
if index < 0 or index >= self.count:
return -1
cur = self.head
self.count -= 1
for _ in range(index):
cur = cur.next
cur.next = cur.next.next
Leetcode206
题目:反转链表
学习资料:代码随想录
初始思路:
- 经典反转链表;一段时间不写,就容易不清晰
- 双指针方法,利用临时指针存储cur的next
学习后:
- 多画图,注意终止条件
- 递归方法
实现过程
思路一:双指针
class ListNode():
def __init__(self, val=0, next=None):
self.val = val
self.next = next
def reverse(head):
cur = head
pre = None
while cur:
temp = cur.next
cur.next = pre
pre = cur
cur = temp
return pre
思路二:递归
def reverse_1(head):
return reverse_rec(head, None)
def reverse_rec(cur, pre):
if cur == None:
return pre
temp = cur.next
cur.next = pre
reverse_rec(temp, cur)