正文

合并链表(数据结构)2006-11-13 13:18:00

【评论】 【打印】 【字体: 】 本文链接:http://blog.pfan.cn/hammers/20274.html

分享到:

#include"link_list.h"
int main()

 int i;
 link_list L1;
 link_list L2;
 cout<<"now put in the data in the first list L1"<<endl;
 L1.get_data_in();
 cout<<"now put in the data in the second list L2"<<endl;
 L2.get_data_in();
 cout<<"if you want to printf the combination_increase list please put '1'" <<endl;
    cout<<"if you want to printf the combination_descending list please put '0'" <<endl;
 cin>>i;
 if(i==1)
 {
    L1.combination_increase(&L2);
 L1.get_data_out();
    cout<<"if you want to printf the combination_descending list please put '0'" <<endl;
 int j;cin>>j;
    if(j==0)
 {
  L1.combination_descending(&L2);
  L1.get_data_out();
 }
 }
 if(i==0)
 {
  L1.combination_descending(&L2);
  L1.get_data_out();
  cout<<"if you want to printf the combination_increase list please put '1'" <<endl;
  int j;cin>>j;
 if(j==1)
 {
    L1.combination_increase(&L2);
 L1.get_data_out();
 }
 }
 return 0;
}

阅读(2303) | 评论(0)


版权声明:编程爱好者网站为此博客服务提供商,如本文牵涉到版权问题,编程爱好者网站不承担相关责任,如有版权问题请直接与本文作者联系解决。谢谢!

评论

暂无评论
您需要登录后才能评论,请 登录 或者 注册