c_cpp 搜索链接列表中的元素（迭代和递归）

Posted 2021-05-14

// https://www.geeksforgeeks.org/search-an-element-in-a-linked-list-iterative-and-recursive/
#include <iostream>
#include <list>
using namespace std;

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

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

int search (node* list, int x) {
    if (list == NULL)
        return 0;
    if (list->data==x)
        return 1;
    return search(list->next,x);
}

int main () {
    int n;
    head = NULL;
    while (true) {
        cout<< "Enter the element, enter -9 to stop: ";
        cin>>n;
        if (n==-9)
            break;
        else
            insert(n);
    }
    cout<< "Enter the search element: ";
    cin>>n;
    if (search(head, n)==1)
        cout<< "Yes!";
    else
        cout<< "No!";


}

// https://www.geeksforgeeks.org/search-an-element-in-a-linked-list-iterative-and-recursive/
#include <iostream>
#include <list>
using namespace std;

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

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

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

    while (head != NULL) {
        if (head->data == n){
            cout<< "Yes!";
            exit(0);
        }
        head = head->next;
    }
    cout<< "No!";
}