c_cpp 找到给定链表的中间位置

Posted 2021-05-14

//https://www.geeksforgeeks.org/find-length-of-loop-in-linked-list/
#include<iostream>
#include<list>
using namespace std;

struct linked_list {
    int data;
    struct linked_list* next;
};
typedef struct linked_list node;

node* insert(node* head, int n) {
    node* list = (node*)malloc(sizeof(node*));
    list->data=n;
    list->next=head;
    head=list;
    return head;
}

void print(node* head) {
    node* n = head;
    while (n != NULL) {
        cout<< n->data << "->";
        n = n->next;
    }
    cout<< "\n";
}

void FindMiddle (node* head) {
    node *slow=head, *fast=head;
    if (head != NULL) {
        while (fast && fast->next) {
            fast = fast->next->next;
            slow = slow->next;
        }
        cout<< "Middle node is "<< slow->data;
    }
}

int main() {
    int n;
    node* head = NULL;
    while (true) {
        cout<< "Enter the element, enter -9 to stop: ";
        cin>>n;
        if (n==-9)
            break;
        else
            head = insert(head,n);
    }
    print (head);
    FindMiddle (head);
}