已知一个顺序表L，打印输出顺序表第i个元素的值，写出完整的算法

已知一个顺序表L，打印输出顺序表第i个元素的值，写出完整的算法

#include<stdio.h>
int N=10;
int main()
{
int i,a[N];
for(i=1;i<=N;i++)
{
printf("输入第%d个数:",i);
scanf("%d",&a[i-1]);
}
printf("你想输出第几个数：");
scanf("%d",&i);
printf("%d\n",a[i-1]);
}

struct list *p, *q, *s, *head; p = head; while(p != null) { if(x > p->data) { q = p; p = p->next; } else { s = (struct list*)malloc(sizeof(struct list)); s->data = x; q->next = s; s->next = p; } } 提问者评价 谢谢

#include<iostream> #include<vector> using namespace std; int main(){ vector<int> list; list.push_back(1); list.push_back(2); list.push_back(3); vector<int>::iterator itor; for(itor = list.begin(); itor != list.end(); itor++) cout<<*itor<<endl; return 0; }

这个我运行过了，没问题的~ typedef struct node{ int data; struct node *next; }node,Linklist; int getelem(Linklist *L,int i); int main() { Linklist *L,*p; int n; cout<<"input n:"; scanf("%d",&n); L=(Linklist*)malloc(sizeof(node)); if(L==NULL) cout<<"none of space!"; L->next=NULL; for(int i=0;i<n;i++) { p=(Linklist*)malloc(sizeof(node)); cout<<"input data:"; scanf("%d",&p->data); p->next=L->next; L->next=p;} cout<<"input end!"; int g=getelem(L,3); cout<<"g="<<g; system("pause"); return 0; } int getelem(Linklist *L,int i) { Linklist *p; p=L->next; int j=1; while(p&&j<i) { p=p->next; ++j; // } if(!p||j>i) { cout<<"j="<<j<<endl; cout<<p->data; return 0;} cout<<"output data:"; printf("%d",p->data); return 1; }

bool Print(SqList a, int i) { if(i > a.length) return false; printf("\n%d\n", a.data[i]); return true; }