java代码
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39
|
public static Node deleteNodeInLink(Node head, int data) { if (head.data == data) { head = head.next; return head; } Node previous = head; Node current = previous; while (current.next != null) { current = current.next; if (current.data == data) { previous.next = null; previous.next = current.next; current.next = null; return head; } else { previous = current; } } return head; }
|