Java Linked List search and delete method

Question

I have a project for computer science class and have everything done except for one method. The delete method. Basically I am making a linked list from user input and I need

Answer 1

All you need to do is search through the list, keeping track of where you are. When the node you want to delete is in front of you, set the current node's "next" to the one after the one you want to delete:

for(Node current = list; current.next() != null; current = current.next()){
   if(current.next().magazine().equals(toDelete)) current.setNext(current.next().next());
}

Something like that. Hope that helps!

Answer 2

Without spoon feeding you the answer. deletion is a bit like removing one link of a chain - you cut out the link and join up the two (new) ends.

So, deleting "B" would mean changing

A --> B --> C --> D

to this

A --> C --> D

In pseudo code, the algorithm would be:

• start the algorithm with the first node
• check if it is the one you want to delete
• if not, go to the next node and check again (go back to the previous step)
• if so, make the next node of the previous node the next node of this node
• remove the reference from this node to the next node

Answer 3

public void delete (Magazine mag) {
    MagazineNode current = this.list;
    MagazineNode before;

    //if is the first element
    if (current.equals(mag)) {
        this.list = current.next;
        return;     //ending the method
    }


    before = current;

    //while there are elements in the list
    while ((current = current.next) != null) {

        //if is the current element
        if (current.equals(mag)) {
            before.next = current.next;
            return;     //endind the method 
        }

        before = current;
    }

    //it isnt in the list
}

the comments should explains whats happening