链表转置

#include<iostream>
#include<vector>
using namespace std;
struct NODE
{
	int data;
	NODE *next;
};
NODE *fnew(NODE *L)
{
	if(L==NULL)
	return 0;
	vector<NODE *>a;
	NODE *n=L;
	while(n!=NULL)
	{
		a.push_back(n);
		n=n->next;
	}
	int size=a.size();
	NODE *head=a[size-1];
	int i;
	for(i=size-1;i>=0;i--)
	{
		if(i==0)
		{
			a[i]->next=NULL;
			break;
		}
		a[i]->next=a[i-1];
	}
	return head;
}
int main()
{
	NODE s1,s2,s3,s4;
	s1.data=1;
	s1.next=&s2;
	s2.data=2;
	s2.next=&s3;
	s3.data=3;
	s3.next=&s4;
	s4.data=4;
	s4.next=NULL;
	NODE *n=fnew(&s1);
	while(n!=NULL)
	{
		cout<<n->data<<endl;
		n=n->next;
	}
	return 0;
}