02 - 선형 구조 2 리 버스 링 링크 목록

    ：         ，          ，            ，     

#include
#include

#define MAXSIZE 100001 //100001=100000+1


typedef struct LNode *Ptr; 
struct LNode{
	int address;
	int data; 
	int next;
	Ptr link; //     
}list;

Ptr Reverse(Ptr head, int K,int L);
Ptr MakeList(int f_add, int next_add[],int data[],int L); 
void Attach(int a,int n_a,int data,Ptr *pRear);
void PrintList(Ptr P);


int main()
{
	int K = 0, L = 0; //K         ，L      
	int link_num = 0;//      
	int i;//     
	
	int address_tmp;//    
	int first_add;//    
	
	Ptr p,p_tmp,r_p;

	int Next[MAXSIZE] ;// address    
	int Data[MAXSIZE] ;// address    
	
	//     ，    ，     
	scanf("%d %d %d",&first_add,&L,&K);
	//            
	for(i = 0 ; i < L ; i++){ 
		scanf("%d",&address_tmp);//     
		scanf("%d %d",&Data[address_tmp],&Next[address_tmp]); 			
	}
 
 	//       
	p = MakeList(first_add,Next,Data,L);
	
	//     ******************    *****************************
	if(K<=L){//K<=L      
		for(i = 0; i < (L/K); i++){
			r_p = Reverse(p,K,L);	
			p_tmp ->link = r_p;//        
			p_tmp ->next =  r_p->address;
			for(int j = 0; j < 	K; j++ ){
	// p                 （           ）  
				p_tmp = p_tmp->link;
			}
		} 
	}
	//************************************************************
	
	//    
	PrintList(p_tmp); 
	 
	return 0;
} 
 
 
Ptr MakeList(int f_add, int next_add[],int data[],int L)
{
	Ptr P , Rear, t; 
	int t_L = L;
	int a,n_a,d,tmp_n_a;
	int i;
	
	P = (Ptr)malloc(sizeof(struct LNode));//      
	P->link = NULL; 
	Rear = P;
	
	//      
	a = f_add;
	d = data[a];
	n_a = next_add[a]; 
	Attach(a,n_a,d,&Rear); 
	t_L--; 
			
	while(t_L--){//       
		a = n_a;
		d = data[a];
		n_a = next_add[a];
		Attach(a,n_a,d,&Rear); 
	}
	//t = P;P=P->link;free(t);//         
	return P; 
}

void Attach(int a,int n_a,int data,Ptr *pRear)
{
	Ptr P;
	P = (Ptr)malloc(sizeof(struct LNode));
	
	P->address = a;
	P->data = data;
	P->next = n_a;
	P->link = NULL;
	
	(*pRear)->link = P;
	*pRear = P;	
}
 
Ptr Reverse(Ptr head, int K,int L)
{
	int cnt = 1;
	Ptr new_, old,tmp;
	//       new_，        ，new_ = head->link; 
	new_ = head->link;
	//            old， old = new_->link; 
	old = new_->link;
	while(cnt < K){
		//      tmp，   old     ，tmp = old->link;
		tmp = old->link;
		// old     new_, old->link = new_;  
		old->link =new_;
		//old       new_     
		old->next = new_->address;
		//  ，old         new_        new_，
		//      old           new_，new_ = old;  		
		new_ = old;
		//    old    tmp，old = tmp; 
		old = tmp;
		cnt ++; 
	} 
	///                           
	head->link->link = old;
	
	if(old != NULL){//       
		head->link->next = old -> address;	
	}
	else{
		head->link->next = -1;//          
	}
	return new_; 
}

void PrintList(Ptr P)
{
	while(P){
		if(P->next == -1) {//             
			printf("%.5d %d %d
",P->address,P->data,P->next);
		}
		else{
			printf("%.5d %d %.5d
",P->address,P->data,P->next);
		//    ，%.5           5 ，      0  ：22，  ：00022
		}		
		P = P->link;
	}	
}