链表分割

最新推荐文章于 2024-11-09 23:45:15 发布

伱恏呀呀呀呀

最新推荐文章于 2024-11-09 23:45:15 发布

阅读量55

点赞数 1

文章标签：数据结构 Powered by 金山文档

本文链接：https://blog.csdn.net/awww224112/article/details/129692843

版权

题目描述：

/*
struct ListNode {
    int val;
    struct ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};*/
#include<malloc.h>
#define NULL __null
class Partition {
  public:
    ListNode* partition(ListNode* pHead, int x) {
            ListNode* lHead, * gHead ;
            ListNode* llist, * glist ;
            lHead = llist = (ListNode* )malloc(sizeof(ListNode));
            gHead = glist = (ListNode*)malloc(sizeof(ListNode));
            ListNode* Head = pHead;
            llist->next=glist->next=NULL;
            while (Head)
            {
                if (Head->val < x) 
                {
                    llist->next = Head;
                    llist = llist->next;
                    Head = Head->next;
                } 
                else 
                {
                    glist->next = Head;
                    glist = glist->next;
                    Head = Head->next;
                }
            }
            llist->next = gHead->next;
            pHead = lHead->next;
            glist->next = NULL;
            free(lHead);
            free(gHead);
            lHead = gHead = NULL;
            return pHead;
        }
};

题目链接：https://www.nowcoder.com/practice/0e27e0b064de4eacac178676ef9c9d70?tpId=8&&tqId=11004&rp=2&ru=/activity/oj&qru=/ta/cracking-the-coding-interview/question-ranking