摘要:
class Node{public:int data;Node* next;};Node* ReverseList(Node *head){if((head->next == NULL) || (head == NULL))return head;Node *temp1 = head;Node *temp2;Node *temp3 = temp1->next;temp1->nex... 阅读全文
posted @ 2010-05-19 00:32 凹凸Man 阅读(677) 评论(0) 推荐(1)
浙公网安备 33010602011771号