小程序 给定链接截取参数
Algorithm:
算法:
Function: slltocll()
函数:slltocll()
Input: A singly linked list whose address of the first node is stored in a pointer, say head
输入:一个单链表 ,其第一个节点的地址存储在指针中,例如head
Output: The same circular linked list
输出:相同的循环链表
Data structure used: Singly linked list where each node contains a data element say data, and the address of the immediate next node say next, with Head holding the address of the first node.
所使用的数据结构:单链列表,其中每个节点包含一个数据元素,例如data ,直接下一个节点的地址说next ,其中Head保留第一个节点的地址。
Pseudo code:
伪代码:
Begin
temp=head
while(temp->next!=NULL)
begin
temp=temp->next
end While
//link head to the next of last node
temp->next=head
End
C code:
C代码:
#include <stdio.h>
#include <stdlib.h>
typedef struct list
{
int data;
struct list *next;
}node;
void display(node *temp)
{
//now temp1 is head basically
node *temp1=temp;
printf("The list is as follows :\n%d->",temp->data);
temp=temp->next;
//which not circle back to head node
while(temp!=temp1)
{
printf("%d->",temp->data);
temp=temp->next;
}
printf("%d\n",temp1->data);
return;
}
int main(){
node *head=NULL,*temp,*temp1;
int choice,count=0,key;
//Taking the linked list as input
do
{
temp=(node *)malloc(sizeof(node));
if(temp!=NULL)
{
printf("\nEnter the element in the list : ");
scanf("%d",&temp->data);
temp->next=NULL;
if(head==NULL)
{
head=temp;
}
else
{
temp1=head;
while(temp1->next!=NULL)
{
temp1=temp1->next;
}
temp1->next=temp;
}
}
else
{
printf("\nMemory not avilable...node allocation is not possible");
}
printf("\nIf you wish to add m ore data on the list enter 1 : ");
scanf("%d",&choice);
}while(choice==1);
//In order to convert a singly linked list to a
//circular singly linked list we just need to copy
//the address of the head node to the next of the last node
temp=head;
//travarsing to the last node
while(temp->next!=NULL)
{
temp=temp->next;
}
//the address of the head is copied to the next part
//of the last node.....now it is a circular singly linked list
temp->next=head;
display(head);
return 0;
}
Output
输出量
Enter the element in the list : 1
If you wish to add m ore data on the list enter 1 : 1
Enter the element in the list : 2
If you wish to add m ore data on the list enter 1 : 1
Enter the element in the list : 3
If you wish to add m ore data on the list enter 1 : 1
Enter the element in the list : 4
If you wish to add m ore data on the list enter 1 : 1
Enter the element in the list : 5
If you wish to add m ore data on the list enter 1 : 0
The list is as follows :
1->2->3->4->5->1
翻译自: https://www.includehelp.com/c-programs/convert-a-given-singly-linked-list-to-a-circular-list.aspx
小程序 给定链接截取参数