Ccqingkong的博客

链表反转

#include <iostream> using namespace std; typedef struct Node { int data; struct Node *next; } node; int lenList(node *head) { if (head == NULL) return 0; node *p = head; int len = 0; while(p != NULL) { len++; p = p->next; } retu.