链表插入(线性表)

2014-11-24 00:35:09 · 作者: · 浏览: 0

Time Limit: 1 Sec Memory Limit: 128 MB

Submit: 173 Solved: 67
[Submit][Status][Web Board]

Description

(线性表)已知一单向链表,从第二个结点至表尾递增有序,(设a1 Input

输入长度n:7

输入数据:4 1 2 3 6 8 9

Output

1 2 3 4 6 8 9

Sample Input

511 7 8 9 10

Sample Output

7 8 9 10 11
#include
   
    
using namespace std;
struct mm
{
int a;
mm *p;

};
int main()
{
	int n,s;
	mm *head,*k,b,*h;
	cin>>n>>b.a;
	b.p=NULL;
	s=n;
	n--;
	if(n==0)
	{cout<
    
     >k->a; k->p=new mm; k=k->p; k->p=NULL; } delete k; h=k=head;n=s; if(b.a
     
      a) {b.p=head; head=&b;} else { for(;s>0;s--) { if(b.a
      
       a) {b.p=k; h->p=&b; break; } if(s==2&&k->a
       
        p=&b; break;} h=k; k=k->p; } } k=head; while(n--) { cout<
        
         a<<' '; k=k->p;} return 0;}
        
       
      
     
    
   

心得:偷了点懒,嘎嘎,链表还是比较麻烦。