Using the +n or -n parameter, where n is a number, you can rotate the stack left or right, as shown in Listing 5.

使用 +n 或 -n 参数，其中 n 是一个数字，您可以向左或向右移动堆栈，如 清单 5 所示。

youdao

This article gives three algorithms for all permutations of 1 to N, analyzing the application of this problem in stack and enumeration of binary tree.

文章给出了1至N全排列问题的三种求解算法，分析了该问题在栈及二叉树计数中的应用。

youdao

Programming tasks: for a given n stack stone, into a pile of programming the calculation of the minimum scores and maximum scores.

编程任务： 对于给定n堆石子，编程计算合并成一堆的最小得分和最大得分。

youdao

If I want to move this stack here, I'm going to take a stack of size n minus 1 move it to the spare spot, now I can move the base disk over, and then I'm going to move that stack of size n minus 1 to there. That's literally what I did, OK?

如果我想移动这些圆盘，我先把从n-1个圆盘1,移动到多余的柱子上去，这样我就能把最底下的圆盘放到这儿了，然后再把从n-1个圆盘放到这儿来,这就是确切的我怎么做的对不对？

麻省理工公开课 - 计算机科学及编程导论课程节选