王道数据结构p41——22
代码
#include<stdio.h>
#include<stdlib.h>
typedef struct lnode{
int data;
lnode *next;
}lnode,*linklist;
int find_k(linklist &l,int k);
void printlink(linklist &l);
void creat(linklist &l,int a[],int n);
int main(){
linklist l;
linklist l2;
linklist c;
l = (lnode*)malloc(sizeof(lnode));
l->next = NULL;
l2 = (lnode*)malloc(sizeof(lnode));
l2->next = NULL;
int a[10] = {1,2,3,4,5,6,7,8,9,10};
creat(l,a,10);
//printf("\n%d",find_k(l,11));
printf("\n%d",find_k(l,3));
//printlink(c);
return 0;
}
int find_k(linklist &l,int k){
lnode *p,*q;
p = l->next;
q = p;
int i = 0;
for(i = 0;i < k;i++){
if(p==NULL) break;
p = p->next;
}
if(i<k) return -1;
while(p!=NULL){
p = p->next;
q = q->next;
}
return q->data;
}
void printlink(linklist &l){
lnode *s=l->next;
while(s!=NULL){
printf("%d\n",s->data);
s=s->next;
}
}
void creat(linklist &l,int a[],int n){
lnode *s,*p;
s=l;
for(int i=0;i<n;i++){
p = (lnode*)malloc(sizeof(lnode));
p->data = a[i];
s->next = p;
s=p;
}
s->next = NULL;
}
注:跟题目要求的结果有些许出入(为了省事)