LeetCode (237):Delete Node in a Linked List

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.

Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, the linked list should become 1 -> 2 -> 4 after calling your function.

/**
 * 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;  
        node.val = node.next.val;  
        node.next = node.next.next; 
    }
}

　首先判空，删除节点时将val值变为下个节点的值，然后将next指向下一个节点。

LeetCode (237):Delete Node in a Linked List

原文：http://www.cnblogs.com/rever/p/4836584.html