Problems Description
<p class="p0"> 将一组数字进行排列,以得到不同的组合顺序,例如<span>1 2 3</span><span>这三items数的排列组合成的三位数有 </span><span>123</span><span>、</span><span>132</span><span>、</span><span>213</span><span>、</span><span>231</span><span>、</span><span>312</span><span>、</span><span>321</span><span>。给定一items数字</span><span>n</span><span>,编程计算并输出</span><span>这items</span><span>n位</span><span>数的所有的排列组合。</span> </p>
Input格式
<p class="p0"> 1<span>items数。</span> </p>
Output格式
<p class="p0"> 输出所有的排列组合,每一种组合占一行。要求输出的数值从上到下是递增的。 </p>
Sample
Sample Input 1
3
Sample Output 1
123
132
213
231
312
321
Submit Code
请先Login后Submit
🤖 AI 解题助手
OpenRouter
就绪