代码:

/**
 * 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) {
        if(node == null) return;
        while(node.next != null){
            node.val = node.next.val;
            if(node.next.next != null){
                node = node.next;
            }
            else{
                node.next = null;
            }
        }
        node = node.next;
    }
}

  

posted on 2016-01-13 07:40  爱推理的骑士  阅读(112)  评论(0编辑  收藏  举报