题解 | #输出单向链表中倒数第k个结点#
输出单向链表中倒数第k个结点
http://www.nowcoder.com/practice/54404a78aec1435a81150f15f899417d
#include <cstdio>
using namespace std;
int main() {
int n, k;
int arr[1005];
while(EOF != scanf("%d", &n)) {
for(int i = 0; i < n; i++) {
scanf("%d", arr + i);
}
scanf("%d", &k);
printf("%d\n", arr[n - k]);
}
return 0;
}