實現鏈表逆序

今天聽課的時候突然提到一個問題，如何把鏈表逆序，考慮一下，簡單指標操作即可。 

#include<iostream>using namespace std;struct node{int data;node* next;};class LinkedList{public:LinkedList(){first = new node;int i = 1;node* p = first;while(i < 10){node* q = new node;q->data = i;q->next = NULL;p->next = q;p = p->next;i++;}};void putOut(){node* p = first->next;while(p != NULL){cout << p->data << endl;p = p->next;}};void reverse(){node* p = NULL;node* q = first->next;while(q != NULL){node *m = q->next;q->next = p;if(m == NULL){first->next = q;break;}else{p = q;q = m;}}}private:node* first;};int main(){LinkedList a;a.putOut();a.reverse();a.putOut();return 0;}