237. Delete Node in a Linked List, nodelinked

Source: Internet
Author: User

237. Delete Node in a Linked List, nodelinked

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 value3, The linked list shoshould become1-> 2-> 4After calling your function.

 

1/** 2 * Definition for singly-linked list. 3 * struct ListNode {4 * int val; 5 * struct ListNode * next; 6 *}; 7 */8 void deleteNode (struct ListNode * node) {9 if (node = NULL | node-> next = NULL) 10 return; 11 node-> val = node-> next-> val; // assign the next node value to delete the current node 12 node-> next = node-> next; // Delete the next node 13}

 

Related Article

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.