数据结构与算法学习笔记（四）

void CreateListHead (LinkList *L,int n) {
    LinkList p;
    int i;
    
    srand(time(0)); //初始化随机数种子
    
    *L = (LinkList)malloc(sizeof(Node));
    (*L)->next = NULL;
    
    for (i = 0; i < n; i++) {
        p = (LinkList)malloc(sizeof(Node));
        p->data = rand()%100+1;
        p->next = (*L)->next
    }
}

void CreateListTail (LinkList *L,int n) {
    LinkList p,r;
    int i;
    
    srand(time(0)); //初始化随机数种子
    
    *L = (LinkList)malloc(sizeof(Node));
    r = *L;
    
    for (i = 0; i < n; i++) {
        p = (Node *)malloc(sizeof(Node));
        p->data = rand()%100+1;
        r->next = p;
        r = p;
    }
    r->next = NULL;
}