3、,则翻转后2→1→4→3→6→5,若k=3,翻转后3→2→1→6→5→4,若k=4,翻转后4→3→2→1→5→6,用程序实现非递归可运行代码:#include #include #include typedef struct node { struct node *next; int data; } node; void createList(node **head, int data) {
4、 node *pre, *cur, *new; pre = NULL; cur = *head; while (cur != NULL) { pre = cur; cur = cur->next; } new = (node *)malloc(sizeof(node)); new->data = data; new->next = cur; if (pre == NUL
5、L) *head = new; else pre->next = new; } void printLink(node *head) { while (head->next != NULL) { printf("%d ", head->data); head = head->next; } printf("%d", head->data); } int
6、 linkLen(node *head) { int len = 0; while (head != NULL) { len ++; head = head->next; } return len; } node* reverseK(node *head, int k) { int i, len, time, now; len = linkLen(head);
7、 if (len < k) { return head; } else { time = len / k; } node *newhead, *prev, *next, *old, *tail; for (now = 0, tail = NULL; now < time; now ++) { old = head; for (i = 0, prev = NULL; i <
8、k; i ++) { next = head->next; head->next = prev; prev = head; head = next; } if (now == 0) { newhead = prev; } old->next = head;
9、if (tail != NULL) { tail->next = prev; } tail = old; } if (head != NULL) { tail->next = head; } return newhead; } int main(void) { int i, n, k, data;