#include <stdio.h>
#include <stdlib.h>
typedef struct LinkList{
int score;
struct LinkList *next;
}Node,*LinkList;
//头插法
LinkList CreateListFromStart(LinkList head){
head->next = NULL;
LinkList node = head->next;
//printf("head->score = %d",head->score);
int count = 5;
int i;
for(i=0;i<count;i++){
node = (LinkList)malloc(sizeof(LinkList));
if(node == NULL){
printf("allocate memory error");
}
else{
node->score = i;
node->next = head->next;
head->next = node;
}
}
return head;
}
//尾插法
LinkList CreateListFromEnd(LinkList head){
LinkList end,node;
head = end;
head->next = NULL;
int i;
int count = 5;
for(i=0;i<count;i++){
node = (LinkList)malloc(sizeof(LinkList));
node->score = i;
end->next = node;
end = node;
}
end->next = NULL;
return head;
}
//删除节点
LinkList DeleteNode(LinkList head){
int Index = 4;
int i;
LinkList node=head->next;
for(i=1;i<Index-1;i++){
node = node->next;
//printf("%d\n",node->score);
}
node->next = node->next->next;
return head;
}
//插入节点
LinkList insertNode(LinkList head){
int Index = 3;
int num = 8;
int i;
LinkList pNode = malloc(sizeof(LinkList));
LinkList node = head->next;
for(i=1;i<Index;i++){
node = node->next;
}
pNode->score = num;
pNode->next = node->next;
node->next = pNode;
return head;
}
LinkList reverseKGroup(LinkList head, int k){
int count=0,i=0,j=0,sum=0;
LinkList pNode,newHead,p1,p2,p3;
pNode = head->next;
while(pNode != NULL){
pNode = pNode->next;
sum++;
}
count = sum/k;
p1 = head->next;
newHead = head;
for(i=0;i<count;i++){
for(j=0;j<k;j++){
while(p1){
p2 = p1->next;
p3 = p2->next;
p2->next = head->next;
p1->next = p3;
head->next = p2;
j++;
}
}
i++;
}
return newHead;
}
//链表逆序
LinkList ReverseNode(LinkList head){
LinkList p1,p2;
p1 = head->next;
while(p1->next){ //从head之后第二个点开始,如果只有一个点,没有必要反转 head点没有数据
p2 = p1->next;
p1->next = p2->next;
p2->next = head->next;
head->next = p2;
}
return head;
}
int main()
{
//LinkList node = CreateList(node);
LinkList node = CreateListFromEnd(node);
//node = ReverseNode(node);
node = reverseKGroup(node,2);
//node = DeleteNode(node);
//node = insertNode(node);
while(node->next != NULL){
node = node->next;
printf("value is %d\n",node->score);
}
return 0;
}