数据结构C语言循环链表练习之俄罗斯轮盘赌

编译器：

/*****************************
*project :数据结构
*function :循环链表之俄罗斯赌盘
*Author :Rookie Uzz
*****************************
*copyright:2019.2.27 by UZT
****************************/

#include <stdio.h>
#include <stdlib.h>
#include "CListTest.h"
#include <time.h>
#define MAX_NUM 1000    //最大容量

int Bet();

int main()
{
    Bet();
    return 0;
}

int Bet()
{
    /** 被杀死的赌徒地址 */
    Gambler * n = (Gambler*)malloc(sizeof(Gambler));
    /** 被删除的结点 */
    lineNode * nodee;
    /** 链表删除位置 */
    int pos = 0;
    /** 赌徒个数 */
    int num;
    /** 轮数 */
    int round = 1;
    /** 赌徒数据 */
    Gambler gab[MAX_NUM];
    //先设置随机数种子，time(0)是得到当前时时间值
    srand((int)time(NULL));
    /** 子弹 */
    int shoot;
    /** 定义链表 */
    linelist * line = (linelist*)malloc(sizeof(linelist));
    printf("请输入赌徒个数：");
    scanf("%d",&num);
    //初始化链表
    for(int i = 0;i < num;i++)
    {
        gab[i].id = i+1;
    }
    InitLine(line,gab,num);
    printf("按任意键继续......\n");
    getchar();
    getchar();
    printf("初始化后赌徒分别是：\n");
    PrintLine(line);
    /*
    nodee = deleteLine(line,7);
    printf("删除后链表为：\n");
    PrintLine(line);
    int n = SearchPos(line,nodee);
    printf("该结点的位置是：%d",n);
    */

    nodee = line -> next;
    while(num != 1)
    {
        printf("\n*********************************\n");
        pos = SearchPos(line,nodee);
        printf("第%d轮,从%d号赌徒开始\n",round,nodee -> persons.id);
        shoot = rand()%num + 1;
        pos += (shoot - 1);
        printf("枪在第 %d 次扣动扳机时会响\n",shoot);
        nodee = deleteLine(line,pos,n);
        printf("编号为 %d 的赌徒被杀死,剩余赌徒编号依次为：\n",n -> id);
        PrintLine(line);
        num--;
        round++;
        printf("*********************************\n");
    }
    printf("最终胜利的赌徒编号是：%d\n",line -> next -> persons.id);
    free(line);
    free(n);
    return 0;
}

#ifndef ELEMENT_H_INCLUDED
#define ELEMENT_H_INCLUDED
#define OK 1
#define FALSE -1

/** 定义赌徒 */
typedef struct Gambler{
    int id;
    //char * name;
}Gambler;

#endif

#ifndef CLISTTEST_H_INCLUDED
#define CLISTTEST_H_INCLUDED
#include "Element.h"

/** 定义一个循环链表结点 */
typedef struct lineNode{
    Gambler persons;     //数据域
    struct lineNode * next; //指针域
}lineNode;

/** 定义一个头指针 */
typedef struct linelist{
    lineNode * next;
    int length;
}linelist;

/** 初始化链表 */
void InitLine(linelist * line,Gambler * person,int length);

/** 插入链表 */
void InsertLine(linelist * line,Gambler person,int pos);

/** 删除并返回删除节点的下一结点 */
lineNode * deleteLine(linelist * line,int pos,Gambler * num);

/** 打印 */
void PrintLine(linelist * line);

/** 通过结点查找位置 */
int SearchPos(linelist * line,lineNode * nodee);


#endif // CLISTTEST_H_INCLUDED

/*****************************
*project    :数据结构
*function   :循环链表之俄罗斯赌盘
*Author        :rookie uzz
*****************************
*copyright:2019.2.27 by UZT
****************************/
#include <stdio.h>
#include <stdlib.h>
#include "CListTest.h"

/** 初始化链表 */
void InitLine(linelist * line,Gambler * person,int length)//应该引入*person
{
    line -> next = NULL;
    line -> length = 0;
    for(int  i  = 0;i < length;i++)
    {
        InsertLine(line,person[i],i+1);
    }
    printf("长度为：%d\n",line -> length);
}

/** 插入链表 */
void InsertLine(linelist * line,Gambler person,int pos)
{
    lineNode * node = (lineNode*)malloc(sizeof(lineNode));
    node -> persons = person;
    node -> next = NULL;
    if(pos == 1)
    {
        if(line -> length == 0)
        {
            line -> next = node;
            node -> next = node;
        }
        else
        {
            lineNode * lastNode = line -> next;
            for(int i = 0;i < ((line -> length) - 1);i++)
            {
                lastNode = lastNode -> next;
            }
            node -> next = line -> next;
            line -> next = node;
            lastNode -> next = node;
        }
        line -> length++;//不要忘了加长！！！！
        return;
    }
    lineNode * currentNode = line -> next;
    for(int i = 1;i < pos - 1;i++)
    {
        currentNode = currentNode -> next;
    }
    node -> next = currentNode -> next;
    currentNode -> next = node;
    line -> length++;
}

/** 删除并返回删除节点的下一结点 */
lineNode * deleteLine(linelist * line,int pos,Gambler * num)
{
    lineNode * returnNode;
    lineNode * node = line -> next;
    if((pos % (line -> length)) == 1)//关键,最大bug
    {
        if(node)
        {
            *num = node -> persons;
            lineNode * lastNode = line -> next;
            for(int i = 1;i < line -> length;i++)
            {
                lastNode = lastNode -> next;
            }
            line -> next  = node -> next;
            lastNode -> next = line -> next;
            free(node);
        }
        line -> length--;
        returnNode = line -> next;
        return returnNode;
    }
    lineNode * preNode;
    for(int i = 1;node&&i < pos;i++)
    {
        preNode = node;
        node  = node -> next;
    }
    if(node)
    {
        *num = node -> persons;
        returnNode = node -> next;
        preNode -> next = node -> next;
        line -> length--;
        free(node);
    }
    return returnNode;
}

/** 打印 */
void PrintLine(linelist * line)
{
    if(line -> length == 0 || !line -> next)
    {
        printf("链表为空！\n");
        return;
    }
    lineNode * node = line -> next;
    for(int i = 0;i < line -> length;i++)
    {
        printf("%d号赌徒\t",node -> persons.id);
        node = node -> next;
    }
    printf("\n");
}

/** 通过结点查找位置 */
int SearchPos(linelist * line,lineNode * nodee)
{
    lineNode * node = line -> next;
    if(node == nodee)
        return 1;
    for(int i = 1;i < line -> length;i++)
    {
        node = node -> next;
        if(node == nodee)
        {
            return i + 1;
        }
    }
    return FALSE;
}