【发布时间】：2016-07-30 15:32:54
【问题描述】：
您好，我为链表编写了一个库，但我遇到了这个错误和问题。我不知道该怎么做。如果我在第一个 typedef struct listNode 中更改为 list 并在第二个 listNode 中更改为 listItem 然后在linked_lists 中将所有 listNode 替换为 listItem 一切正常，但我需要实现一个列表初始化函数，我认为制作另一个存储列表头和项目数的结构，当我遇到此错误时，我到达了这一点。
linked_lists.h 代码：
#ifndef linked_lists_h
#define linked_lists_h
#include <stdio.h>
struct listNode;
typedef struct listNode{
int value;
struct list *next;
}listNode;
struct listaa{
int count;
listNode *head;
};
void deleteFirst(listNode *head);
void display(listNode *head);
void addInFront (listNode *head, int value);
void addLast (listNode *head, int value);
void deleteLast(listNode *head);
void add_at_poz(listNode *head, int value, int poz);
void insert_at_poz(listNode *head, int value, int poz);
void delete_at_poz(listNode *head, int poz);
void max(listNode *head);
void min(listNode *head);
#endif /* linked_lists_h */
linked_lists.c 代码：
#include "linked_lists.h"
#include "stdlib.h"
// Single Linked Lists
void display(listNode *head) { // Display a linked list.
if(head->next != NULL){
listNode *current;
current = head;
while (current->next != NULL) {
current = current->next;
printf("%d, ", current->value);
}
} else {
printf("Lista este goala");
}
printf("\n");
}
//Adding value functions
// Adding in front of the list
void addInFront(listNode *head, int value) {
listNode *new_item;
new_item = (listNode *) malloc(sizeof(listNode));
new_item->next = head->next;
new_item->value = value;
head->next = new_item;
printf("Valoare %d a fost adaugata.\n", value);
}
// Adding at the end of the list
void addLast(listNode *head, int value) {
listNode *new_item,*current = head;
new_item = (listNode *) malloc(sizeof(listNode));
while(current->next != NULL)
current = current->next;
new_item->value = value;
new_item->next = NULL;
current->next = new_item;
}
// Adding a new item at specified pozition
void add_at_poz(listNode *head, int value, int poz) {
poz = poz - 1;
int iter = 0;
listNode *current = head, *new_item;
while(iter < poz) {
current = current->next;
iter++;
}
new_item = (listNode *)malloc(sizeof(listNode));
new_item = current->next;
current->next = new_item;
new_item->value = value;
}
// Insert a new item at specified pozition
void insert_at_poz(listNode *head, int value, int poz) {
poz = poz - 1;
int iter = 0;
listNode *current = head, *new_item;
while(iter < poz) {
current = current->next;
iter++;
}
new_item = (listNode *)malloc(sizeof(listNode));
new_item->next = current->next;
current->next = new_item;
new_item->value = value;
}
// Remove items from list
// Remove first item
void deleteFirst(listNode *head) {
listNode *deletedItem;
deletedItem = head->next;
printf("Elementul %d a fost sters din fata.\n", deletedItem->value);
head->next = deletedItem->next;
free(deletedItem);
}
// Delete last item
void deleteLast(listNode *head) {
listNode *deletedItem, *current;
current = head;
while(current->next->next != NULL)
current = current->next;
deletedItem = current->next;
printf("Ultimul elementul %d a fost sters\n",deletedItem->value);
current->next = NULL;
free(deletedItem);
}
void delete_at_poz(listNode *head,int poz) {
int iter = 0;
listNode *deletedItem, *current = head;
poz = poz - 1;
while(iter < poz) {
current = current->next;
iter++;
}
deletedItem = current->next;
current->next = deletedItem->next;
printf("Elementul de pe pozitia %d cu valoare %d a fost sters. \n", poz+1,deletedItem->value);
free(deletedItem);
}
void max(listNode *head) {
listNode *current;
int max = head->next->value;
current = head;
while (current->next != NULL) {
current=current->next;
if(current->value > max)
max = current->value;
}
printf("Maximul este %d.\n", max);
}
void min(listNode *head) {
listNode *current;
int min = head->next->value;
current = head;
while (current->next != NULL) {
current=current->next;
if(current->value < min)
min = current->value;
}
printf("Minimul este %d.\n", min);
}
【问题讨论】：
-
struct list在哪里定义？你有一个struct listaa，但没有struct list。
标签： c struct linked-list