用于更新链接列表中项目的程序

伪代码

procedure fibonacci : fib_num
   
   IF fib_num less than 1
      DISPLAY 0
      
   IF fib_num equals to 1
      DISPLAY 1
      
   IF fib_num equals to 2
      DISPLAY 1, 1
      
   IF fib_num greater than 2
   
      Pre = 1,
      Post = 1,
      
      DISPLAY Pre, Post
      FOR 0 to fib_num-2
         Fib = Pre + Post
         DISPLAY Fib
         Pre = Post
         Post = Fib
      END FOR
   END IF

end procedure

实现

该算法的实现如下 −

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

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

struct node *head = NULL;
struct node *current = NULL;

//创建链接列表
void insert(int data) {
   // 为新节点分配内存;
   struct node *link = (struct node*) malloc(sizeof(struct node));

   link->data = data;
   link->next = NULL;

   // 如果 head 为空，则创建新列表
   if(head==NULL) {
      head = link;
      return;
   }

   current = head;
   
   // 移至列表末尾
   while(current->next!=NULL)
      current = current->next;
   
   // 在列表末尾插入链接
   current->next = link; 
}

void display() {
   struct node *ptr = head;

   printf("
[head] =>");
   //从头开始
   while(ptr != NULL) {
      printf(" %d =>",ptr->data);
      ptr = ptr->next;
   }

   printf(" [null]
");
}

void update_data(int old, int new) {
   int pos = 0;
   
   if(head==NULL) {
      printf("Linked List not initialized");
      return;
   } 

   current = head;
   while(current->next!=NULL) {
      if(current->data == old) {
         current->data = new;
         printf("
%d found at position %d, replaced with %d
", old, pos, new);
         return;
      }
      
      current = current->next;
      pos++;
   }
   
   printf("%d does not exist in the list
", old);
}

int main() {
   insert(10);
   insert(20);
   insert(30);
   insert(1);
   insert(40);
   insert(56); 

   display();
   update_data(40, 44);
   display();
   
   return 0;
}

输出

程序的输出应为 −

[head] => 10 => 20 => 30 => 1 => 40 => 56 => [null]

40 found at position 4, replaced with 44

[head] => 10 => 20 => 30 => 1 => 44 => 56 => [null]

linked_list_programs_in_c.html