237. Delete Node in a Linked List

最新推荐文章于 2024-07-21 08:42:04 发布

zhouyanz

最新推荐文章于 2024-07-21 08:42:04 发布

阅读量215

点赞数

分类专栏： Leetcode 文章标签： Java LeetCode

本文链接：https://blog.csdn.net/zhouyanz/article/details/50926498

版权

Leetcode 专栏收录该内容

196 篇文章 0 订阅

订阅专栏

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.

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

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