有没有人帮我看看哪里写错了，要哭了

[万万啊]

/*实现如下操作：根据键盘输入的n个整型元素建立单链表（要求单链表的元素顺序和输入的元素顺序一致），并且在第pos（1<=pos<=n）个位置插入一个新的整型元素x。输出插入成功后的元素序列，要求输出元素之间用空格隔开。*/#include <stdlib.h> #include <iostream> #define MaxSize 100 #include <iostream> using namespace std; struct Node{ int data; Node *next;}; class Linklist{ public: void insret(int pos,int x); Linklist(int a[],int n); void PrintList( ); private: Node *first; }; Linklist::Linklist(int a[], int n){ Node *r; first=new Node; r=first; for(int i=0;i<n;i++) { Node *s; s=new Node; s->data=a[i]; r->next=s; r=s; } r->next=NULL; } void Linklist::insret(int pos,int x){ Node *p; Node *s; p=first; int count=0; while(p!=NULL&&count<pos-1) { p=p->next; count++;} if(p==NULL) throw"位置"; else { s=new Node; s->data=x; s->next=p->next; p->next=s; } } int main(){ int n,pos,x; cin>>n; int a[n]; int i; for(i=0;i<n;i++) cin>>a[i]; Linklist L(a,n); cin>>pos; cin>>x; L.insret(pos,x); for(i=0;i<n;i++) { cout<<a[i]<<" "; } return 0;}

[蠓虫带着秤砣飞]

搜一下怎么跟踪调试自己跟踪一下。

[蠓虫带着秤砣飞]

好了

#include <stdlib.h>
#include <iostream>
#include <iostream>

using namespace std;

#define MaxSize 100

struct Node
{
	int data;
	Node *next;
};
class Linklist
{
public:	
	void insret(int pos,int x);	
	Linklist(int a[],int n);	
	void PrintList();	
private:
	Node *first;	
};
Linklist::Linklist(int a[], int n)
{	
	Node *r = NULL;
	for(int i=0;i<n;i++)
	{
		Node *s = new Node;  
		if (r == NULL)
		{
			r = s;
		}
		else
		{
			r->next = s;
			r = r->next;
		}

		r->data=a[i];
		r->next=NULL;  	

		if (i == 0)
		{
			first = r;
		}
	} 
}

void Linklist::insret(int pos,int x)
{	
	Node *p;  
	Node *s;
	p=first;	
	int count=0;	
	while(p != NULL && count < pos-1)
	{
		p=p->next;	
		count++;
	}	

	if(p==NULL)	
	{
		throw"位置";	
	}
	else
	{	
		s=new Node;	
		s->data=x;	
		s->next=p->next;	
		p->next=s;	
	}	
}	

void Linklist::PrintList()
{
	Node *cur = first;
	while(cur)
	{
		cout << cur->data << " ";
		cur = cur->next;
	}

	cout << endl;
}

int main()
{
	int n,pos,x;	
	cin>>n;	
	int *a = new int[n];
	int i;	
	for(i=0;i<n;i++)
	{
		cin>>a[i];
	}

	Linklist L(a,n);	
	cin>>pos;	
	cin>>x;
	L.insret(pos,x); 
	for(i=0;i<n;i++)  	
	{
		cout<<a[i]<<" ";
	}
	cout << endl;
	L.PrintList();

	delete [] a;
	getchar();
	return 0;
}