i want to add all the inserted linked list by using this code
but what happens here if i input 15 then 35 =50 but when i input again 30 the sum is 50whats wrong with my code?
int sum(nd **head){
nd *p,*sum1;
p=*head;
sum1=0;
while(p!=NULL)
{
sum1->x=p->x;
p=p->next;
return sum1->x=sum1->x+p->x;
}
}
why is sum a linked list and not a simple integer?
int sum(nd **head){
nd *pl
int sum1 = 0;
p=*head;
while(p!=NULL)
{
sum1 += p->x;
p=p->next;
}
return sum1;
}why is sum a linked list and not a simple integer?
int sum(nd **head){ nd *pl int sum1 = 0; p=*head; while(p!=NULL) { sum1 += p->x; p=p->next; } return sum1; }
actualy i dont know how to di this ...i tired you code it works :)
how about this one where i want to locate if the linked list is in the lis?
int locate(nd **head,int num){
nd *p;
p=*head;
while(p!=NULL)
{
p=p->next;
if(num==p->x)
return 1;
else
return 0;
}
}almost there -- the else and return 0 should not be inside the loop. And move p=p->next; to the bottom of the loop.
why is sum a linked list and not a simple integer?
int sum(nd **head){ nd *pl int sum1 = 0; p=*head; while(p!=NULL) { sum1 += p->x; p=p->next; } return sum1; }
actualy i dont know how to di this ...i tired you code it works :)
how about this one where i want to locate if the linked list is in the lis?
int locate(nd **head,int num){ nd *p; p=*head; while(p!=NULL) { p=p->next; if(num==p->x) return 1; else return 0; } }
int locate(nd **head,int num){
nd *p;
p=*head;
while(p!=NULL)
{
p=p->next;
}
if(num==p->x)
return 1;
else
return 0;
}
the code above always return to xero
int locate(nd **head,int num){
nd *p;
p=*head;
while(p!=NULL)
{
p=p->next;
}
if(num==p->x)
return 1;
else
return 0;
}the code above always return to xero
Look and think about the logic in the code you posted, pay attention to the while loop. All it does is iterate through the linked list without stopping. The if statement needs to be inside the loop -- I did not tell you to move it outside the loop. The else part shoud not be there at all.
int locate(nd **head,int num){
nd *p;
p=*head;
while(p!=NULL)
{
p=p->next;
if(num==p->x)
return 1;
}
return 0;
}Look and think about the logic in the code you posted, pay attention to the while loop. All it does is iterate through the linked list without stopping. The if statement needs to be inside the loop -- I did not tell you to move it outside the loop. The else part shoud not be there at all.
int locate(nd **head,int num){ nd *p; p=*head; while(p!=NULL) { p=p->next; if(num==p->x) return 1; } return 0; }
thankls it work :):cheesy:
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.