PTA 数组循环左移

数组循环左移

题目要求:
这里写图片描述

Code:

#include <stdio.h>
#include <stdlib.h>

struct list {
    int data;
    struct list *next;
};

struct list *randlist(struct list *l, int n)
{
    struct list *h, *s, *p;
    h = (struct list *)malloc(sizeof(struct list));
    h = l;
    s = l;
    while(n) {
        p = s;
        scanf("%d", &s->data);
        s = (struct list *)malloc(sizeof(struct list));
        p->next = s;
        n --;
    }
    p->next = NULL;
    return p;
}

struct list *dolist(struct list *l, struct list *e, int k)
{
    int i = 0;
    struct list *p, *h, *head;
    p = l;
    h = l;
    head = l;
    while(p) {
        i ++;
        if(i == k) {
            head = p->next;
            p->next = NULL;
            e->next = h;
            break;
        }
        p = p->next;
    }
    return head;
}

void getlist(struct list *l)
{
    struct list *p = l;
    printf("%d", p->data);
    p = p->next;
    while(p) {
        printf(" %d", p->data);
        p = p->next;
    }
}

int main(void)
{
    int i, n, k;
    scanf("%d %d", &n, &k);
    while(k >= n) {
        k -= n;
    }
    struct list *h, *e, *l;
    l = (struct list *)malloc(sizeof(struct list));
    e = randlist(l, n);
    h = dolist(l, e, k);
    getlist(h);
    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值