/** * Simple implementation of a Linked List. * Input: The element between 1 and 10 you want to search. */ #include #include struct Node { std::shared_ptr next; int data; }; struct MainNode { std::shared_ptr head{new Node}; }; void insert_head(std::shared_ptr& head, std::shared_ptr el) { el->next = head; head = el; } void print_list(std::shared_ptr head) { int idx = 0; std::shared_ptr currentNode; currentNode = head; std::cout << "{\n"; while(currentNode!=nullptr) { currentNode->next ? std::cout << "\tv[" << idx << "] => " << currentNode->data << ",\n" : std::cout << "\tv[" << idx << "] => " << currentNode->data << std::endl; currentNode = currentNode->next; idx += 1; } std::cout << "}\n"; } int search_list(std::shared_ptr head, int key) { int idx = 0; std::shared_ptr currentNode; currentNode = head; while(currentNode!=nullptr) { if(currentNode->data == key) return idx; currentNode = currentNode->next; idx += 1; } idx = -1; return idx; } int has_list(std::shared_ptr head, int key) { std::shared_ptr currentNode; currentNode = head; while(currentNode!=nullptr) { if(currentNode->data == key) return 1; currentNode = currentNode->next; } return 0; } int main(void) { int key = 5; std::cin >> key; std::shared_ptr mainNode{new MainNode}; mainNode->head = nullptr; for(int i = 0; i < 10; i++) { std::shared_ptr node{new Node}; node->data = i+1; insert_head(mainNode->head, node); } print_list(mainNode->head); if(has_list(mainNode->head, key)) std::cout << "Element " << key << " is at index: " << search_list(mainNode->head, key); else std::cout << "Element " << key << " not found."; return 0; }

Linked List in C++