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

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

    Given linked list -- head = [4,5,1,9], which looks like following:

    Example 1:

    Input: head = [4,5,1,9], node = 5
    Output: [4,1,9]
    Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.
    

    Example 2:

    Input: head = [4,5,1,9], node = 1
    Output: [4,5,9]
    Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.
    

    Note:

    • The linked list will have at least two elements.
    • All of the nodes' values will be unique.
    • The given node will not be the tail and it will always be a valid node of the linked list.
    • Do not return anything from your function.

    刚开始题目都没看懂,后来看了discuss才知道,题目想要做什么。

    给定链表中的一个结点,把这个结点删除。  因为只是给定了结点,并没有链表的head。

    所以,处理方式是,将结点的值,往前移动,然后删除最后一个结点。

    public void DeleteNode(ListNode node)
            {
                ListNode nodePrev = node;
                while (node.next != null)
                {
                    node.val = node.next.val;
                    nodePrev = node;
                    node = node.next;
                }
    
                nodePrev.next = null;
            }
  • 相关阅读:
    图床_OpenStack-镜像服务
    图床_OpenStack-认证服务
    图床_OpenStack-基础环境
    #linux包之tcpdump之tcpdump命令
    利用OpenCms9提供的模块创建新站点
    Cocos2d-x3.0下实现循环列表
    Modbus读写模拟量寄存器具体解释
    C++ 实践总结
    spring Quartz基于配置文件和注解的实现
    EEPLAT学习
  • 原文地址:https://www.cnblogs.com/chucklu/p/10509969.html
Copyright © 2011-2022 走看看