单链表操作

1.单链表创建、逆序、删除、排序代码

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
struct Node
{
 int data;
 struct Node *next;
};
int main()
{
 struct Node *current,
             *newNode,
             *head,
             *temp,
             *NextCurrent;
 int a[10]={1,3,2,4,5,6,7,8,9,0};
 int i;
 //create linklist
 head=(struct Node*)malloc(sizeof(struct Node));
 current=head;
 head->next=NULL;
 for(i=0;i<10;i++)
  {
   newNode=(struct Node*)malloc(sizeof(struct Node));
   newNode->data=a[i];
   newNode->next=NULL;
   current->next=newNode;
   current=current->next;
  }
 printf("Linklist:");
 for(current=head->next;current!=NULL;current=current->next)
    printf("%d...",current->data);
 printf("\n");
 //revert linklist
 current=head->next;
 NextCurrent=head->next->next;
 while(NextCurrent!=NULL)
    {
     temp=NextCurrent->next;
     NextCurrent->next=current;
          current=NextCurrent;
     NextCurrent=temp;
    }
 head->next->next=NULL;
 head->next=current;
 printf("LinkRevert:");
 for(current=head->next;current!=NULL;current=current->next)
    printf("%d...",current->data);
 printf("\n");
 //Linklist length
 current=head->next;
 int count=0;
 printf("length of Linklist:");
 while(current)
     {
       count++;
       current=current->next;
     }
 printf("%d\n",count);
 //delete node
 int Number;
 printf("delete Number:");
 scanf("%d",&Number);
 struct Node *pre;
 pre=head;
 current=head->next;
 while(current!=NULL)
     {
       if(current->data==Number)
         {
           pre->next=current->next;
         }
       pre=current;
       current=current->next;
     }
 current=head->next;
 printf("deleted Linklist:");
 while(current)
     {
       printf("%d..",current->data);
               current=current->next;
      }
  printf("\n");
  printf("sorted Linklist:");
  current=head;
  int ptemp,j;
  for(i=0;i<9;i++)
    {
     current=head;
     for(j=0;j<9-i;j++)
       {
        if(current->data>current->next->data)
          {
           ptemp=current->data;
           current->data=current->next->data;
           current->next->data=ptemp;
          }
        current=current->next;
       }
    }
  current=head->next;
  while(current)
      {
       printf("%d..",current->data);
       current=current->next;
      }
  printf("\n");
  return 0;
 }

运行结果

Linklist:1...3...2...4...5...6...7...8...9...0...
LinkRevert:0...9...8...7...6...5...4...2...3...1...
length of Linklist:10
delete Number:9
deleted Linklist:0..8..7..6..5..4..2..3..1..
sorted Linklist:0..1..2..3..4..5..6..7..8..