Singly-linked list/Element removal: Difference between revisions
Added C implementation.
(Added C implementation.) |
|||
Line 85:
</lang>
=={{header|C}}==
This implementation takes up integers from the command line and then asks which element has to be removed. List is printed before and after removal, usage printed on incorrect invocation.
<lang C>
/*Abhishek Ghosh, 4th October 2017*/
#include<stdlib.h>
#include<stdio.h>
typedef struct elem{
int data;
struct elem* next;
}cell;
typedef cell* list;
list addToList(list a,int num){
list iter, temp;
int i=0;
if(a==NULL){
a = (list)malloc(sizeof(cell));
a->data = num;
a->next = NULL;
}
else{
iter = a;
while(iter->next!=NULL){
iter = iter->next;
}
temp = (list)malloc(sizeof(cell));
temp->data = num;
temp->next = NULL;
iter->next = temp;
}
return a;
}
list deleteFromList(list a,int pos){
int i=1;
list temp,iter;
if(a!=NULL){
iter = a;
if(pos==1){
a = a->next;
iter->next = NULL;
free(iter);
}
else{
while(i++!=pos-1)
iter = iter->next;
temp = iter->next;
iter->next = temp->next;
temp->next = NULL;
free(temp);
}
}
return a;
}
void printList(list a){
list temp = a;
printf("List contains following elements : \n");
while(temp!=NULL){
printf("%d ",temp->data);
temp = temp->next;
}
}
int main(int argC,char* argV[])
{
list a = NULL;
int i;
if(argC == 1)
printf("Usage : %s <list of integers to be inserted into the list>",argV[0]);
else{
for(i=2;i<=argC;i++)
a = addToList(a,atoi(argV[i-1]));
printList(a);
do{
printf("\nEnter position of element to be removed (1-%d) : ",argC-1);
scanf("%d",&i);
if(i>0 && i<=argC-1){
a = deleteFromList(a,i);
printList(a);
}
}while(i>argC-1||i<=0);
}
return 0;
}
</lang>
Invocation, interaction and output :
<pre>
C:\rosettaCode>linkedList.exe 1 2 3
List contains following elements :
1 2 3
Enter position of element to be removed (1-3) : 2
List contains following elements :
1 3
</pre>
=={{header|Fortran}}==
This sort of thing has long been done in Fortran via the standard trick of fiddling with arrays, and using array indices as the equivalent of the memory addresses of nodes. The task makes no mention of there being any content associated with the links of the linked-list; this would be supplied via auxiliary arrays or disc file records, ''etc''. With F90 and later, one can define compound data aggregates, so something like LL.NEXT would hold the link to the next element and LL.STUFF would hold the cargo, with LL being an array of such a compound entity rather than separate simple arrays such as LLNEXT and LLSTUFF.
| |||