题目:删除链表的倒数第 N 个结点
链接:https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list/
例一:
输入:head = [1,2,3,4,5], n = 2
输出:[1,2,3,5]
例二:
输入:head = [1], n = 1
输出:[]
例三
输入:head = [1,2], n = 1
输出:[1]
思路:
我们采用双指针的方式,快指针listNode_fast和慢指针listNode_slow同时指向dummy节点,当listNode_fast指向NULL时候,中间夹着n个元素时候,删除listNode_slow下一节点,即可
1、设置虚拟节点dummy,指向head→解决要删除头节点的情况(eg:[1],1);
2、指针listNode_fast和listNode_slow分别指向head和dummy;
3、移动listNode_fast,直到两指针相隔n个元素;
4、同时移动listNode_fast和listNode_slow,直到listNode_fast指向NULL;
5、将listNode_slow.next指向下下节点。
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution(object):
def removeNthFromEnd(self, head, n):
"""
:type head: ListNode
:type n: int
:rtype: ListNode
"""
dummy = ListNode(0, head)
listNode_slow = dummy
listNode_fast = head
for _ in range(n):
listNode_fast = lsitNode_fast.next
while listNode_fast:
listNode_fast = listNode_fast.next
listNode_slow = listNode_slow.next
listNode_slow.next = listNode_slow.next.next
return dummy.next
题目:合并两个有序链表
链接:https://leetcode-cn.com/leetbook/read/top-interview-questions-easy/xnnbp2/
例一:
输入:l1 = [1,2,4], l2 = [1,3,4]
输出:[1,1,2,3,4,4]
例二:
输入:l1 = [], l2 = []
输出:[]
例三:
输入:l1 = [], l2 = [0]
输出:[0]
思路:
1、首先先创建新的链表dumy;
2、判断l1,l2的每个节点的大小,若l1现节点的val > l2现节点的val,则把dumy指向l2现节点,后l2更新到下一节点,反之dumy指向l1现节点,后l1更新到下一节点;
3、当其中一个链表为None,则dumy直接指向另一个链表。
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution(object):
def mergeTwoLists(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
# 处理边界情况
if not l1:
return l2
if not l2:
return l1
dumy = ListNode()
cur = dumy
while l1 and l2:
if l1.val < l2.val:
cur.next = l1
l1 = l1.next
else:
cur.next = l2
l2 = l2.next
cur = cur.next
cur.next = l1 if l1 else l2
return dumy.next