Python单链表删除节点问题：删除指定ID后无法正确输出修改后的SLL

Hey there! As someone who’s fumbled through linked list bugs early on, I totally get how frustrating this can be—especially when every other function works. Let’s break down the most common mistakes beginners make in the delete_node method, since that’s almost certainly where your issue lies.

Common Issues in delete_node (and Fixes) #

1. Forgetting to Update the Head Node When Deleting the First Element #

This is the #1 pitfall for new linked list developers. If the player you’re deleting is the first node in the list, you can’t just skip over it—you need to reassign the list’s head pointer to the second node directly.

Bad Example (What You Might Have):

def delete_node(self, player_id):
    current = self.head
    while current is not None:
        if current.id == player_id:
            # Oops! No handling for head node
            break
        current = current.next

Fix:
Check if the head is the target first. If yes, update the head immediately:

def delete_node(self, player_id):
    current = self.head
    # Case 1: Delete the head node
    if current is not None and current.id == player_id:
        self.head = current.next
        return
    # Track the node before the target
    prev = None
    while current is not None and current.id != player_id:
        prev = current
        current = current.next
    # Case: Player ID not found
    if current is None:
        print("Player not found in list")
        return
    # Case 2: Delete non-head node (including last node)
    prev.next = current.next

2. Not Tracking the Predecessor Node #

Singly linked lists don’t have reverse pointers, so you need to keep track of the node right before the one you want to delete. If you only track the current node, you can’t link the previous node to the next one once you remove the target—meaning the original list structure stays intact.

Bad Example:

def delete_node(self, player_id):
    current = self.head
    while current is not None:
        if current.id == player_id:
            # This just moves the current pointer, doesn't modify the list!
            current = current.next
            return
        current = current.next

This code doesn’t actually change the list’s structure—so when you print, the old node is still present.

3. Ignoring Edge Cases (Empty List or Missing Node) #

If your list is empty, or the player ID doesn’t exist, your code might throw an error (like trying to access None.next) which can break your subsequent output. Always add checks for these scenarios to avoid crashes.

4. Double-Check Your Print Function #

Wait—make sure your print function starts at self.head and traverses until current is None. Sometimes the delete works correctly, but the print function is using an old pointer instead of the updated head.

Correct Print Function Example:

def print_list(self):
    current = self.head
    while current is not None:
        print(f"Player ID: {current.id}, Score: {current.score}")
        current = current.next

内容的提问来源于stack exchange，提问作者MacGenius