[LeetCode] Delete Node in a Linked List

Source: Internet
Author: User

[LeetCode] Delete Node in a Linked List

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

Supposed the linked list is1-> 2-> 3-> 4And you are given the third node with value 3, the linked list shoshould become1-> 2-> 4After calling your function.

Solutions

Make the value of the current node equal to the value of the next node, then the current node points to the next node of the next node, and finally Delete the next node of the node to be deleted.

Implementation Code
// Runtime: 1 MS/*** 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) {node. val = node. next. val; node. next = node. next. next ;}}

 

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.