摘要:
12)按递增次序输出链表结点#include "stdafx.h"#include<iostream>using namespace std;typedef struct node{ int data; struct node *next;}Listnode,*LinkList;int _tmain(int argc, _TCHAR* argv[]){ return 0;}void reverse(LinkList &La){ while(La->next) { LinkList pre=La; LinkList r=pre;//r为辅助指针记录前 阅读全文