[leetcode] Delete Node in a Linked List

最新推荐文章于 2019-03-06 15:09:25 发布

原创最新推荐文章于 2019-03-06 15:09:25 发布 · 397 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

222 篇文章

订阅专栏

本文介绍了一种在单链表中删除指定节点的方法，除了尾节点外，只需访问该节点即可实现删除操作。通过修改待删除节点的值为下一个节点的值，并调整指向关系来完成删除过程。

From : https://leetcode.com/problems/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) {
        int v = 0;
        if(null != node) {
            v = node.val;
        }
        while(null != node && null != node.next) {
            if(v == node.val) {
                node.val = node.next.val;
                node.next = node.next.next;
                break;
            } else {
                node = node.next;
            }
        }
    }
}