输入一个单向链表,输出该链表中倒数第k个结点,链表的倒数第1个结点为链表的尾指针。
链表结点定义如下:
struct ListNode
{
int m_nKey;
ListNode* m_pNext;
};
正常返回倒数第k个结点指针,异常返回空指针。
要求:
(1)正序构建链表;
(2)构建后要忘记链表长度。
数据范围:链表长度满足 1≤n≤1000 ,链表中数据满足 0≤val≤10000
输入描述:1 输入链表结点个数2 输入链表的值3 输入k的值
输出描述:输出一个整数示
输入:8
1 2 3 4 5 6 7 8
4
输出:5
#include<stdio.h>
int count = 0;
typedef struct node
{
int m_nkey;
struct node* m_pNext;
}Node;
//创建单向链表
Node* creatList()
{
Node* headNode = (Node*)malloc(sizeof(Node));
headNode->m_pNext = NULL;
return headNode;
}
//创建结点
Node* creatNode(int m_nkey)
{
Node* newNode = (Node*)malloc(sizeof(Node));
newNode->m_nkey = m_nkey;
newNode->m_pNext = NULL;
return newNode;
}
//表尾插入结点
void insertByBack(Node* headNode, int m_nkey)
{
Node* newNode = creatNode(m_nkey);
Node* pMove = headNode;
while (pMove->m_pNext != NULL)
{
pMove = pMove->m_pNext;
}
pMove->m_pNext = newNode;
count++; //每插入一个结点,节点数+1
}
//获取倒数第k个结点的值
int getNodeValue(Node* headNode, int k)
{
if (k > count || k==0) return NULL;
Node* pMove = headNode;
for (int i = 0; i < (count - k +1); i++) //倒数第k个 = 整数第(count - k +1)
{
pMove = pMove->m_pNext;
}
return pMove->m_nkey;
}
int main()
{
int num;//输入结点个数
int val;//每个结点值
int k; //要返回的倒数第k个节点值
//创建链表头节点
Node* headNode = creatList();
while (scanf("%d", &num) != EOF)
{
for (int i = 0; i < num; i++)
{
scanf("%d", &val);
insertByBack(headNode, val);
}
scanf("%d", &k);
printf("%d\n", getNodeValue(headNode, k));
}
}