描述
有如下的结构体:
typedef struct Node
{
int data;//存放数据
struct Node *pNext;//指向下一个结构体对象
}NODE,*pNODE;
现输入n(0<n<100)个数字,请用这n个整数构造出一个升序的链表,并打印出给定位置m(0<m<=n)的值;
输入
n
N1 N2 N3 … Nn
m
输出
链表中第m个位置的data值
样例
输入 输出
2 1
1 2
1
输入 输出
4 5
7 5 0 2
3
代码
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct Node
{
int data;//存放数据
struct Node *pNext;//指向下一个结构体对象
}NODE,*pNODE;
int main()
{
int n, i, m, t;
scanf("%d", &n);//n个数字
scanf("%d", &m);//第一个数字
pNODE p;
pNODE head = (pNODE)malloc(sizeof(NODE));
head->data = m;
head->pNext = NULL;
for (i = 0; i < n - 1; i++)
{
scanf("%d", &m);
pNODE q = (pNODE)malloc(sizeof(NODE));
q->data = m;
q->pNext = NULL;
if (m < head->data)
{
q->pNext = head;//head->pNext=head;
head = q;
}
else
{
p = head;//p用来搜索
while (p != NULL)
{
if (p->pNext == NULL)//要先检测!
{
p->pNext = q;
break;
}
else if(m<p->pNext->data)
{
q->pNext = p->pNext;
p->pNext = q;
break;
}
p = p->pNext;//不要写成p++!
}
}
}
scanf("%d", &t);
p = head;
for (i = 0; i < t-1; i++)
{
p = p->pNext;
}
printf("%d\n", p->data);
return 0;
}