237. Delete Node in a Linked List

删除链表中给定的结点，可以将后边结点的值赋值给前面的结点，将最后一个结点删除

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public void deleteNode(ListNode node) {
        node = deNode(node);
    }
    private ListNode deNode(ListNode node){
        if(node.next == null) return null;
        node.val = node.next.val;
        node.next = deNode(node.next);
        return node;
    }
}

转载于:https://my.oschina.net/yyyyyang/blog/640217