递归反转链表改变原链表吗

Solution:

解：

Algorithm to find length

查找长度的算法

Input:

输入：

A whose address of the first node is stored in a pointer, say head.

一个 ，其第一个节点的地址存储在指针(例如head)中。

Output:

输出：

The no of nodes in the list, c

列表中的节点数c

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 ，头保持第一个节点的地址。

Pseudo code:

伪代码：

Begin    temp=head    c=0 //counter to store count of nodes    While(temp!=NULL) //upto end of linked list	    begin	    c=c+1	    temp=temp->next    End whileEnd

C code:

C代码：

#include 
    
     #include 
     
      //node sructuretypedef struct list {
   	int data;	struct list *next;}node;int length(node *temp);int main(){
   	node *head=NULL,*temp,*temp1;	int choice,count;	//building linked list	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 more data on the list enter 1 : ");		scanf("%d",&choice);	}while(choice==1);		//Now counting the length of the list using a user defined function	count=length(head);	printf("\nThe length of the list is : %d",count);		return 0;}//function to find length iterativelyint length(node *temp) {
   	int c=0;	//travarsing to the end of the list and count the number of nodes	while(temp!=NULL)		{
   		c=c+1;		temp=temp->next;	}	return c;}
     
    

Output

输出量

Enter the element in the list : 1If you wish to add more data on the list enter 1 : 1Enter the element in the list : 2If you wish to add more data on the list enter 1 : 1Enter the element in the list : 3If you wish to add more data on the list enter 1 : 1Enter the element in the list : 4If you wish to add more data on the list enter 1 : 1Enter the element in the list : 5If you wish to add more data on the list enter 1 : 0The length of the list is : 5

翻译自:

递归反转链表改变原链表吗