This Might help:
void inverse(struct node **headref,int n){
struct node *temp=*headref;
struct node *temp1=*headref;
struct node *temp2=*headref;
while(temp->next!=NULL){
temp=temp->next;
}
while(n!=1){
temp1=temp1->next;
n--;
}
swap(temp2->data,temp1->data);
swap(temp1->next->data,temp->data);
}
On Wed, Aug 31, 2011 at 11:39 AM, Mohit kumar lal
<kumarmohit...@gmail.com>wrote:
> SWAP Nth node's value with 1st node's value and N+1th node's value with
> last node's value.We can do this by maintaining 3 pointer 1st one pints to
> start node,2nd one points to Nth node and 3rd one points to last node...:)
>
>
> On Wed, Aug 31, 2011 at 11:15 AM, Avinash Dharan
> <avinashdha...@gmail.com>wrote:
>
>> That would work dheerjaj. Only thing is links reassignment should be taken
>> care of.
>>
>>
>> On Wed, Aug 31, 2011 at 10:40 AM, Dheeraj Sharma <
>> dheerajsharma1...@gmail.com> wrote:
>>
>>> remove the 'n' nodes from the beginning..push in the stack..pop them up
>>> and insert at the end of linked list..till the stack becomes empty..do this
>>> for(m/n) times..m is length of list..
>>> correct me if i am wrong
>>>
>>>
>>> On Wed, Aug 31, 2011 at 6:57 AM, Reynald Suz <reynaldsus...@gmail.com>wrote:
>>>
>>>> Question:
>>>> Given: A singly linked list and a number 'n'.
>>>> Write a program, that will reverse consecutive 'n' nodes in the linked
>>>> list.
>>>> Optimize for space and time.
>>>>
>>>> Example:
>>>> Input:
>>>> Linked list: A->B->C->D->E->F
>>>> number 'n': 3
>>>>
>>>> Output:
>>>> C->B->A->F->E->D
>>>>
>>>>
>>>> --
>>>> Regards
>>>> Reynald Reni
>>>> Masters in Software Engineering
>>>> CIT - India
>>>>
>>>> --
>>>> You received this message because you are subscribed to the Google
>>>> Groups "Algorithm Geeks" group.
>>>> To post to this group, send email to algogeeks@googlegroups.com.
>>>> To unsubscribe from this group, send email to
>>>> algogeeks+unsubscr...@googlegroups.com.
>>>> For more options, visit this group at
>>>> http://groups.google.com/group/algogeeks?hl=en.
>>>>
>>>
>>>
>>>
>>> --
>>> *Dheeraj Sharma*
>>> Comp Engg.
>>> NIT Kurukshetra
>>>
>>>
>>> --
>>> You received this message because you are subscribed to the Google Groups
>>> "Algorithm Geeks" group.
>>> To post to this group, send email to algogeeks@googlegroups.com.
>>> To unsubscribe from this group, send email to
>>> algogeeks+unsubscr...@googlegroups.com.
>>> For more options, visit this group at
>>> http://groups.google.com/group/algogeeks?hl=en.
>>>
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to algogeeks@googlegroups.com.
>> To unsubscribe from this group, send email to
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>
>
> --
> Mohit kumar lal
> rit2009014
> IIIT ALLAHABAD
> contact@9454681805
> kumarmohit...@gmail.com
> mohitkumar...@yahoo.com
> rit2009...@iiita.ac.in
> http://profile.iiita.ac.in/rit2009014
>
--
Mohit kumar lal
rit2009014
IIIT ALLAHABAD
contact@9454681805
kumarmohit...@gmail.com
mohitkumar...@yahoo.com
rit2009...@iiita.ac.in
http://profile.iiita.ac.in/rit2009014
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
