单向循环链表 头插法 尾插法 遍历 链表长度

循环链表

单向循环链表 头插法 尾插法 遍历 链表长度

代码

// 单向循环链表
#include <iostream>
#include <cstdio>
using namespace std;

typedef struct _CircleLinkList {
    int val;
    struct _CircleLinkList * next;
} CircleLinkList;

CircleLinkList * Create_LinkList_Head();
CircleLinkList * Create_LinkList_End();
void Print_CircleLinkList(CircleLinkList * nodes);
int Get_CirCleLinkList_Size(CircleLinkList * nodes);

int main() {
    CircleLinkList * ptr, * ptr1;

    ptr = new CircleLinkList;
    ptr = Create_LinkList_End();
    Print_CircleLinkList(ptr);
    cout << Get_CirCleLinkList_Size(ptr) << endl;
    ptr1 = new CircleLinkList;
    ptr1 = Create_LinkList_Head();
    Print_CircleLinkList(ptr1);
    cout << Get_CirCleLinkList_Size(ptr1) << endl;

    return 0;
}

// 初始单向循环链表化链表——头插法
CircleLinkList * Create_LinkList_Head() {
    CircleLinkList * head, * node;
    int x;
    head = new CircleLinkList;
    head->next = head;
    //cout << "Input num (with 0 ending it): "  << endl;
    cin >> x;
    while ( x != 0 ) {
        node = new CircleLinkList;
        node->val = x;
        node->next = head->next; // 将头指针所指向的下一个结点的地址，赋给新创建结点的next 
        head->next = node; //  将新创建的结点的地址赋给头指针的下一个结点
        cin >> x;
    }
    return head;
}

// 初始单向循环链表化链表——尾插法
CircleLinkList * Create_LinkList_End() {
    CircleLinkList * head, * node, * end;
    head = new CircleLinkList; // 分配空间
    //end = new CircleLinkList;
    head->next = head;
    end = head; // Initialize nodes using same way, Now size is 0.
    int x;
    cin >> x;
    while ( x != 0) {
        node = new CircleLinkList;
        node->val = x;
        //node->next = end->next;
        end->next = node;
        end = node;
        cin >> x;
    }
    end->next = head;
    return head;
}

// 遍历链表
void Print_CircleLinkList(CircleLinkList * nodes) {
    CircleLinkList * head = nodes;
    nodes = nodes->next;
    //cout << "+++++++++++++++++++" << endl;
    while ( nodes->next != head) {
        cout << nodes->val << " ";
        nodes = nodes->next;
    }
    cout << nodes->val << endl;
}

// 获取链表节点大小(除去头节点)
int Get_CirCleLinkList_Size(CircleLinkList * nodes) {
    int num = 0;
    CircleLinkList * head = nodes;
    if ( nodes->next == head ) {
        //cout << "0" << endl;
        return num;
    }
    else {
        num++;
        nodes = nodes->next;
        while(nodes->next != head) {
            num++;
            nodes = nodes->next;
        }
        // cout << num << endl;
        return num;
    }
}