单链表按序号奇偶分链表

将一个带头结点的单链表按序号的奇偶分为两个链表:headA,headB,并保持顺序不变.

#include <stdio.h>
#include <stdlib.h>
typedef struct node
{
    int data;
    struct node* next;
}LinkList;
LinkList* CreaList()//创建一个新链表
{
    LinkList*head,*r,*s;
    head = (struct LinkList*)malloc(sizeof (LinkList));
    r = head;
    int x;
    scanf("%d",&x);
    while(x != -100)//以-100为结束标志
    {
        s = (struct LinkList*)malloc(sizeof (LinkList));
        s->data = x;
        r->next = s;
        r = s;
        scanf("%d",&x);

    }
    r->next = NULL;

    return head;
}
void PrintList(LinkList* head)//打印链表
{
    LinkList* p = head;
    p = p->next;
    while(p!=NULL)
    {
        printf("%d ",p->data);
        p = p->next;
    }
    printf("\n");
    return 0;
}
LinkList* Selet(LinkList* head)
{
    LinkList* r,*s,*cur;
    int i = 0;//计数
    LinkList* headB = (struct LinkList*)malloc(sizeof(LinkList));
    r = head;
    s = headB;
    cur = head->next;
    r->next = NULL;

    while(cur !=NULL)
    {
        i++;
        if(i%2!=0)//奇数序号
        {
            r->next = cur;
            r = cur;
        }
        else//偶数序号
        {
            s->next = cur;
            s = cur;
        }
         cur = cur->next;
    }
    r->next = NULL;
    s->next = NULL;
    return headB;
}
int main()
{
    LinkList* head,*headA,*headB;
    head = CreaList();
    PrintList(head);
   	PrintList(head);//奇数序号打印
    PrintList(headB);//偶徐序号打印

   
    return 0;
}
  • 4
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
以下是C语言的代码实现: ```c #include <stdio.h> #include <stdlib.h> //定义链表结点结构体 struct ListNode { int val; struct ListNode *next; }; struct ListNode* createList(int arr[], int n) { struct ListNode *head, *p, *q; head = (struct ListNode*)malloc(sizeof(struct ListNode)); head->next = NULL; p = head; for (int i = 0; i < n; i++) { q = (struct ListNode*)malloc(sizeof(struct ListNode)); q->val = arr[i]; q->next = NULL; p->next = q; p = q; } return head; } void printList(struct ListNode* head) { struct ListNode* p = head->next; while (p) { printf("%d ", p->val); p = p->next; } printf("\n"); } struct ListNode* splitList(struct ListNode* head) { struct ListNode *oddHead, *evenHead, *p, *q; oddHead = (struct ListNode*)malloc(sizeof(struct ListNode)); evenHead = (struct ListNode*)malloc(sizeof(struct ListNode)); oddHead->next = NULL; evenHead->next = NULL; p = oddHead; q = evenHead; struct ListNode* cur = head->next; int count = 1; while (cur) { if (count % 2 == 1) { p->next = cur; p = cur; } else { q->next = cur; q = cur; } cur = cur->next; count++; } p->next = NULL; q->next = NULL; head->next = oddHead->next; return evenHead; } int main() { int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9}; int n = sizeof(arr) / sizeof(int); struct ListNode* head = createList(arr, n); printf("Original list: "); printList(head); struct ListNode* evenHead = splitList(head); printf("Odd index list: "); printList(head); printf("Even index list: "); printList(evenHead); return 0; } ``` 这个算法的实现思路是:遍历原链表,将奇数序号的结点连接到一个新的链表上,将偶数序号的结点连接到另一个新的链表上。最后,将原链表的表头指向奇数序号链表的表头,返回偶数序号链表的表头。 同样的,这个算法需要手动创建两个新的链表别保存奇数序号结点和偶数序号结点。最后,由于原链表的表头改变了,需要将原链表的表头指向奇数序号链表的表头。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值