zoukankan      html  css  js  c++  java
  • 237. Delete Node in a Linked List

    1. 问题描述

    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.

    Tags: Linked List
    Similar Problems: (E) Remove Linked List Elements
    /**
    * Definition for singly-linked list.
    * struct ListNode {
    * int val;
    * ListNode *next;
    * ListNode(int x) : val(x), next(NULL) {}
    * };
    */

    2. 解题思路

    3. 代码

     1 class Solution {
     2 public:
     3     void deleteNode(ListNode* node) {
     4         if (NULL == node)
     5         {
     6             return;
     7         }
     8         ListNode *pt = node;
     9         node->val = node->next->val;
    10         node = node->next;
    11         pt->next = node->next;
    12 
    13     }
    14 };

    4. 反思

  • 相关阅读:
    application , application pool., W3wp ,httpapplication, domain
    HDFS
    spark
    Hive
    container docker
    Azure&& hdinsight
    Native Code
    拥抱重构
    六个重构方法可帮你提升80%的代码质量
    重构 小步进行曲
  • 原文地址:https://www.cnblogs.com/whl2012/p/5596729.html
Copyright © 2011-2022 走看看