头条后端组 视频面试

申请北京的头条职位，后端组

聊过去的项目，问细节

编程题
given a circle with 10 nodes, 0->1->2....->9->0, start from 0 node, if allow to move n steps, what is the total number of different paths that the move ends at 0 (start point and end point are same).
For example,

n = 2, total number of different paths = 2: 0->1->0, 0->9->0
n = 4, total number of different paths = 4: 0->1->2->1->0, 0->9->8->9->0, 0->1->0->9->0, 0->9->0->1->0

求大米

怎么感觉楼主给的example不对，n=4的时候还有两种情况，0 -> 1 -> 0 -> 1 -> 0, 0 -> 9 -> 0 -> 9 -> 0?

方便说一下细节问到什么程度吗

看上去挺有用的 赞