Cracking the Coding Interview Q2.3

標籤：style   blog   color   div   re   algorithm   

Implement an algorithm to delete a node in the middle of a single linked list, given only access to that node.

 

思路：複製後面節點的值，然後刪除後面的節點。

注意：如果給定的節點是最後一個，則無解。。

 

    public static boolean deleteNode(LinkedListNode n) {        if (n == null || n.next == null) {            return false; // Failure        }         LinkedListNode next = n.next;         n.data = next.data;         n.next = next.next;         return true;    }