void deleteEven() {
boolean con = false;
Node add;
Node move;
move = head;
if (move.data % 2 == 0) {
head = move.next;
con = true;
}
add = move;
move = move.next;
while (move != null) {
if (move.data % 2 == 0) {
add.next = move.next;
con = true;
}
add = move;
move = move.next;
}
if (!con)
System.out.println("No even numbers in list");
}
它適用於除尾部以外的每個節點。 如果鏈表是[5,4,3,2,2] 結果是[5,3,2] 如何解決這個問題?從鏈表中刪除偶數但不在尾節點工作?