题解 | 输出单向链表中倒数第k个结点

package main

import (
	"fmt"
)

type Node struct {
	value int
	next  *Node
}

func main() {
	for {
		var n int
		_,err := fmt.Scan(&n)
        if err != nil {
            break
        }
		var root *Node
		var cur *Node
		for i := 0; i < n; i++ {
			var v int
			fmt.Scan(&v)
			if i == 0 {
				root = &Node{
					value: v,
					next:  nil,
				}
				cur = root
			} else {
				cur.next = &Node{
					value: v,
					next:  nil,
				}
				cur = cur.next
			}
		}
		var k int
		fmt.Scan(&k)
		var nodeK *Node
		for i := 0; i <= n-k; i++ {
			nodeK = root
			root = root.next
		}
		fmt.Println(nodeK.value)
	}
}