魔术师发牌问题

Posted 2020-10-02 不二小杰

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了魔术师发牌问题相关的知识，希望对你有一定的参考价值。

就是有一堆牌，先跳过零张，翻出第一张为一，然后跳过一张，翻出第二张为2。。。。

被跳过的牌放在最下面。。。。

typedef struct Node
{
    int data;
    struct Node *next;
}Node;

void circle_init(Node *head, const int len);
void circle_set(Node *head, const int len); 
void circle_print(Node *head);
void circle_des(Node *head);

int main()
{
    int len;
    int num;
    Node head = {0, &head};
    
    printf("输入牌的张数：");
    scanf("%d", &len);
    
    circle_init(&head, len); 

    circle_set(&head, len);
    
    circle_print(&head);
    circle_des(&head);
    return 0;
}

void circle_init(Node *head, const int len)
{
    int i = 0;
    Node *p = head;
    
    for(i=0; i<len; i++)
    {
        p->next = (Node *)malloc(sizeof(Node));
        p = p->next;
        p->data = 0;
        p->next = head->next;
    }
    
}

void circle_set(Node *head, const int len)
{
    Node *p = head->next;
    int i = 0;
    int left = len;
    
    p->data = 1;
    left -= 1;
    
    while(left != 0)
    {
        for(i=1; i<=len-left+1; i++)
        {
            while(p->next->data != 0)
            {
                p = p->next;
            }
            p = p->next;
        }
        
        p->data = len-left + 1;
        left -= 1;
    }
}

void circle_print(Node *head)
{
    Node *p = head->next;
    printf("链表：\n");
    
    do {
        printf("%d ", p->data);
        p = p->next;
    }while(p != head->next);
    
    printf("\n");
}

void circle_des(Node *head)
{
    Node *p = head->next;
    Node *temp = NULL;
    
    
    do {
        temp = p->next;
        free(p);
        p = temp;
    }while(p->next != head->next);
    free(p);
    head->next = head;
}