链表翻转

linkList.cpp

#include <iostream>
#include <stdio.h>
#include <string>
#include <map>
#include <algorithm>
using namespace std;


struct Node {
	Node() : value(0), next(NULL) {}
	int value;
	Node *next;
};

typedef Node* NodePtr;

void printList(Node* head) {
	Node* cur = head;
	while (cur != NULL) {
		cout << cur->value << endl;
		cur = cur->next;
	}
}

Node* reverse(Node* head, int n) {
	if (head == NULL) {
		return NULL;
	}
	
	Node* pre = NULL;
	Node* cur = head;
	int k = n;
	while (cur != NULL && k-- > 0) {
		Node* tmp = cur->next;
		cur->next = pre;
		pre = cur;
		cur = tmp;
	}
	head->next = reverse(cur, n);
	return pre;
}

int main() {
	Node* head = new Node();
	head->value = 1;
	Node* cur = head;
	for (int i = 2; i < 9; i++) {
		cur->next = new Node();
		cur->next->value = i;
		cur = cur->next;
	}
	//printList(head);
	Node* newHead = reverse(head, 4);
	printList(newHead);
}