首页 > itarticle > delete node in a linked list

delete node in a linked list

admin 11月 12, 2020 0

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.

题目出处：https://leetcode.com/problems/delete-node-in-a-linked-list/

知识点：node->val等价于(*node).val
定义一个结构体
struct Sample
{
int year;
int month;
};

//第一种使用方法
Sample sample;

//第二种使用方法
Sample *p；
p=&sample;

这里p->year，(*p).year ，sample.year等价。

代码1：

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    void (ListNode* node) {
        if(node==NULL)
        {
            return;
        }
        node->val=node->next->val;
        node->next=node->next->next;   
    }
};

代码2：

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    void (ListNode* node) {
        if(node==NULL)
        {
            return;
        }
        (*node).val=(*((*node).next)).val;
        (*node).next=(*((*node).next)).next;       
    }
};
微海报分享

近期文章

近期评论

标签

热门

文章归档

分类目录

功能