剑指 Offer 18. 删除链表的节点

太过爱你忘了你带给我的痛 2022-09-08 00:17 160阅读 0赞

[https://leetcode-cn.com/problems/shan-chu-lian-biao-de-jie-dian-lcof/submissions/][https_leetcode-cn.com_problems_shan-chu-lian-biao-de-jie-dian-lcof_submissions]

难度简单151

给定单向链表的头指针和一个要删除的节点的值，定义一个函数删除该节点。

返回删除后的链表的头节点。

**注意：**此题对比原题有改动

**示例 1:**

输入: head = [4,5,1,9], val = 5
    输出: [4,1,9]
    解释: 给定你链表中值为 5 的第二个节点，那么在调用了你的函数之后，该链表应变为 4 -> 1 -> 9.

**示例 2:**

输入: head = [4,5,1,9], val = 1
    输出: [4,5,9]
    解释: 给定你链表中值为 1 的第三个节点，那么在调用了你的函数之后，该链表应变为 4 -> 5 -> 9.

**说明：**

*  题目保证链表中节点的值互不相同
 *  若使用 C 或 C++ 语言，你不需要 `free` 或 `delete` 被删除的节点

/**
     * Definition for singly-linked list.
     * public class ListNode {
     *     int val;
     *     ListNode next;
     *     ListNode(int x) { val = x; }
     * }
     */
    class Solution {
        public ListNode deleteNode(ListNode head, int val) {
            ListNode node = head;
            if(head.val == val){
                head = head.next;
                return head;
            }
            while(node.next!=null)
            {
                if(node.next.val == val)
                {
                    node.next = node.next.next;
                }
                if(node.next!=null) node = node.next;
            }
            return head;
        }
    }

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_Q1NETiBA5Yqq5Yqb5a2m5Lmg55qE5qKF5a2Q_size_18_color_FFFFFF_t_70_g_se_x_16][]

[https_leetcode-cn.com_problems_shan-chu-lian-biao-de-jie-dian-lcof_submissions]: https://leetcode-cn.com/problems/shan-chu-lian-biao-de-jie-dian-lcof/submissions/
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_Q1NETiBA5Yqq5Yqb5a2m5Lmg55qE5qKF5a2Q_size_18_color_FFFFFF_t_70_g_se_x_16]: /images/20220829/225745dba9a340f1a3888ac87b98c37b.png