Java [Leetcode 273]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;
    }
}

Java [Leetcode 273]Delete Node in a Linked List

标签：

原文地址：http://www.cnblogs.com/zihaowang/p/5065651.html