C_DS_AIgo/linked_list.c

#include <stdio.h>
#include <stdlib.h>
#include "linked_list.h"

// <20><>ʼ<EFBFBD><CABC>ֵ
node* init_node(elem_type value)
{
	node* new_node = (node*)malloc(sizeof(node));
	if (new_node == NULL)
	{
		printf("error: malloc failed\n");
		return NULL;
	}
	new_node->value = value;
	new_node->next = NULL;
	return new_node;
}

// ɾ<><C9BE><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD>ڵ<EFBFBD>
void delete_node(node* n)
{
	if (n->next != NULL) {
		node* temp = n->next;
		n->next = n->next->next;
		free(temp);
	}
}

// <20>滻<EFBFBD>ڵ<EFBFBD>ֵ
void replace_node(node* n, elem_type value)
{
	n->value = value;
}

// <20><><EFBFBD><EFBFBD><EFBFBD>ڵ<EFBFBD>
void insert_node(node* head,node *new_node)
{
	new_node->next = head->next;
	head->next = new_node;
}

// <20><><EFBFBD>ʽڵ<CABD>
int get_node(node* n)
{
	return n->value;
}

// <20><><EFBFBD><EFBFBD>
address_node *find_node(node* head, elem_type value)
{
	address_node* n = (address_node*)malloc(sizeof(address_node));
	if (n == NULL) {
		printf("<EFBFBD>ڴ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʧ<EFBFBD><EFBFBD>\n");
		return NULL;
	}
	n->n = 1;
	n->p = head->next;
	node *temp = head;
	while (temp->next != NULL) 
	{
		if (temp->value == value)
			return n;
		n->n += 1;
		temp = temp->next;
		n->p = temp;
	}
	printf("<EFBFBD>޷<EFBFBD><EFBFBD>ҵ<EFBFBD><EFBFBD>ڵ<EFBFBD>\n");
	free(n);
	return NULL;
}

// <20><>ӡ<EFBFBD><D3A1><EFBFBD><EFBFBD>
void print_node_list(node* head)
{
	node* head_1 = head;
	//printf("[%d ",head_1->value);
	printf("[");
	while (1)
	{
		printf("%d ", head_1->value);
		head_1 = head_1->next;
		if (head_1 == NULL)
			break;
	}
	printf("]\n");
}

// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
int get_node_list(node* head)
{
	node *head_1 = head;
	int i = 1;
	while (head_1->next != NULL)
	{
		head_1 = head_1->next;
		i++;
	}
	printf("<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ%d\n", i);
	return i;
}


// <20><><EFBFBD><EFBFBD>Ԫ<EFBFBD><D4AA>
elem_type get_node_value(node* head,int pos)
{
	node* head_1 = head;
	int i = 1;
	while (i < pos && head_1)
	{
		head_1 = head_1->next;
		i++;
	}
	if (head_1 == NULL || i != pos)
		return;
	return head_1->value;
}