删除链接列表中的偶数值

Question

我正在练习我的算法，我正在尝试删除链表中的值，但它失败了。在删除偶数值后尝试打印链表类时，因为我提供了测试用例以查看程序是否正常工作。它打印出10和1. 11和1应该是打印的值。

public class LinkedList
{

  private Node head;

  public LinkedList() {
   this.head = null; 
  }

  public void add(int data) {
    Node node = new Node(data);
    if(head == null) {
        node.setNextNode(head);
        head = node;
    }
    else {
       Node curr = head;
      while(curr.next != null) {
       curr = curr.getNextNode(); 
      }
      curr.setNextNode(node);
    }
  }

  public void removeEven() {
   if (this.head==null) return;

    Node prev=null, curr = head;

    while(curr != null) {
      if(curr.data%2 == 0) {
        if(prev == null) {
           Node node = curr.getNextNode();
           node.setNextNode(prev);
           prev = node;
           curr = curr.getNextNode().getNextNode();
        }
        else {
           Node node = curr.getNextNode();
           prev.setNextNode(node);
           curr = curr.getNextNode();
        }
       // curr = curr.getNextNode();
      }

      else{
        prev = curr;
        curr = curr.getNextNode();
      }
    }
  }

  public void print() {
   if(head == null) return;

    Node curr = head;
    while(curr != null) {
      System.out.println(curr);
      curr = curr.getNextNode(); 
    }
  }

  public static void main(String[] args)
  {
     LinkedList h = new LinkedList();
     h.add(10);
     h.add(1);
     h.add(11);
     h.add(8);
     h.removeEven();
     h.print();
  }
}

class Node {
  int data;
  Node next;

  public Node(int data) {
    this(data, null);
  } 

  public Node(int data, Node next) {
    this.data = data;
    this.next = next;
  }

  public void setNextNode(Node next) {
    this.next = next; 
  }

  public Node getNextNode() {
    return this.next; 
  }

  @Override
  public String toString() {
    return "Data: "+this.data; 
  }
}

Answer 1

public class LinkedList
{

  private Node head;

  public LinkedList() {
   this.head = null; 
  }

  public void add(int data) {
    Node node = new Node(data);
    if(head == null) {
        node.setNextNode(head);
        head = node;
    }
    else {
       Node curr = head;
      while(curr.next != null) {
       curr = curr.getNextNode(); 
      }
      curr.setNextNode(node);
    }
  }

  public void removeEven() {
   if (this.head==null) return;

    Node prev=null, curr = head;

    while(curr != null) {
      if(curr.data%2 == 0) {
        if(prev == null) {
           Node node = curr.getNextNode();
           curr.setNextNode(prev);
           prev = node;
           curr = prev.getNextNode();
           head = prev;
        }
        else {
           Node node = curr.getNextNode();
           prev.setNextNode(node);
           curr.setNextNode(null);
           curr = node;
        }
      }

      else{
        prev = curr;
        curr = curr.getNextNode();
      }
    }
  }

  public void print() {
   if(head == null) return;

    Node curr = head;
    while(curr != null) {
      System.out.println(curr);
      curr = curr.getNextNode(); 
    }
  }

  public static void main(String[] args)
  {
     LinkedList h = new LinkedList();
     h.add(10);
     h.add(1);
     h.add(11);
     h.add(8);
     h.removeEven();
     h.print();
  }
}

class Node {
  int data;
  Node next;

  public Node(int data) {
    this(data, null);
  } 

  public Node(int data, Node next) {
    this.data = data;
    this.next = next;
  }

  public void setNextNode(Node next) {
    this.next = next; 
  }

  public Node getNextNode() {
    return this.next; 
  }

  @Override
  public String toString() {
    return "Data: "+this.data; 
  }
}