链表oj题（5道）

最新推荐文章于 2023-02-23 23:49:03 发布

ma_r

最新推荐文章于 2023-02-23 23:49:03 发布

阅读量550

点赞数

文章标签：链表

本文链接：https://blog.csdn.net/Mmmmmmmrr/article/details/89481321

版权

本文介绍了五道关于链表的算法题目，包括删除特定值节点、反转链表、找到链表中间节点、寻找倒数第k个节点以及合并两个有序链表。每个题目都附带相关链接，是提升链表操作技能的好资料。

摘要由CSDN通过智能技术生成

1.删除链表中等于给定值 val 的所有节点
链接: link.
例：删除x=3的结点节点在这里插入图片描述

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* removeElements(struct ListNode* head, int val)
{
    struct ListNode* cur = head;
    struct ListNode* prev = NULL;
    struct ListNode* next;
    while(cur)
    {
        if(cur->val == val)
        {
            next = cur->next;
            free(cur);
            cur = next;
            if(prev == NULL)
            {
                head = next;
            }
            else
            {
                prev->next = next;
            }
        }
        else
        {
            prev = cur;
            cur = cur->next;
        }
        
    }
    return head;
}

2.反转一个单链表
链接: link.
在这里插入图片描述

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* reverseList(struct ListNode* head) {
    struct ListNode* cur = head;
    struct ListNode* prev = NULL;
    struct ListNode* next;
    while(cur)
    {
       next = cur->next;
        cur->next = prev;
        prev = cur;
        cur = next; 
    }
    return prev;
}

3.给定一个带有头结点 head 的非空单链表，返回链表的中间结点。如果有两个中间结点，则返回第二个中间结点。
链接: link.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* middleNode(struct ListNode* head) {
    struct ListNode* cur = head;
    struct ListNode* next;
    int mid = 0;
    int count = 0;
    while(cur)
    {
        count++;
        cur = cur->next;
    }
    mid = count / 2;
    cur = head;
    while(mid--)
    {
        cur = cur->next;
    }
    return cur;
}

4.输入一个链表，输出该链表中倒数第k个结点。
链接: link.

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* FindKthToTail(ListNode* pListHead, unsigned int k) {
    struct ListNode* cur = pListHead;
        struct ListNode* next;
        int count = 0;
        if(k==0)
        {
            return NULL;
        }
        while(cur)
        {
            count++;
           cur = cur->next;
        }
        if(k > count)
        {
            return NULL;
        }
        cur = pListHead;
        count -=k;
        while(count--)
        {
            cur = cur->next;
        }
        return cur;
    }

5.将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
链接: link.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2) {
    struct ListNode* head;
    struct ListNode* cur;
    if(l1 == NULL)
    {
        return l2;
    }
    if(l2 == NULL)
    {
        return l1;
    }
    if(l1->val < l2->val)
    {
        head = l1;
        l1 = l1->next;
    }
    else
    {
        head = l2;
        l2 = l2->next;
    }
    cur = head;
    while(l1 && l2)
    {
        if(l1->val < l2->val)
        {
            cur->next = l1;
            cur = cur->next;
            l1 = l1->next;
        }
        else
        {
            cur->next = l2;
            cur = cur->next;
            l2 = l2->next;
        }
    }
        if(l1)
        {
           cur->next = l1;
        }
        if(l2)
        {
            cur->next = l2;
        }
    return head;
}