c_cpp 天真的SingleLinkedList实现

Posted 2021-05-14

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;

struct Node
{
	int data;
	Node *next;
};

void add(Node *&head, int data)
{
	Node *new_node = (Node*)malloc(sizeof(Node));
	new_node->data = data;
	new_node->next = head;
	head = new_node;
}

Node* remove(Node *&head)
{
	Node *ret = head;
	head = head->next;
	return ret;
}

void print(Node *head)
{
	Node *current = head;
	while (current != nullptr)
	{
		printf("%d -> ", current->data);
		current = current->next;
	}
}

int main()
{
	Node *a = (Node*)malloc(sizeof(Node));
	a->data = 1;
	a->next = nullptr;

	Node *head = a;

	add(head, 3);
	add(head, 2);
	//remove(head);

	print(head);
	
	cin.get();
	return 0;
}