Delete a node in the middle of a one-way linked list. Suppose you can only access this node.

Source: Internet
Author: User
1/* 2 * in this case, you cannot access the first node of the linked list. You can only access the node to be deleted, in fact, we can think 3 * like this: copy the value of the successor node to the current node, the next address of the current node points to the next address of the next node 4 * The Problem of deleting the current node is converted to the problem of deleting the next node 5 * Note the following here, if the end node of the linked list is to be deleted, this problem cannot be solved 6 **/7 public static Boolean deletenode (node) 8 {9 If (node = NULL | node. next = NULL) 10 return false; 11 node n = node. next; 12 node. data = n. data; 13 node. next = n. next; 14 return true; 15}

 

Delete a node in the middle of a one-way linked list. Suppose you can only access this node.

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.