算法面试题解析：层板衣柜问题

def move_shelves(n, zs):
    if n == 1:
        return [[1]]  # 只有一个层板，直接返回

    result = []  # 存储所有移动层板的顺序

    for i in range(n):
        new_zs = zs[:i] + zs[i+1:]  # 剩余层板的高度列表，去除当前层板的高度

        # 递归调用，移动剩余层板
        sub_result = move_shelves(n-1, new_zs)

        # 将当前层板的编号插入到每个子问题的结果中
        for sub in sub_result:
            result.append([i+1] + sub)

    return result

n = int(input("请输入层板个数："))
zs = list(map(int, input("请输入层板距离柜子底部的高度：").split()))

results = move_shelves(n, zs)

# 按小到大排序
results.sort()

print("所有移动层板的顺序：")
for res in results:
    print("，".join(map(str, res)))

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class ShelfMovement {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.print("请输入层板个数：");
        int n = scanner.nextInt();
        int[] zs = new int[n];
        System.out.print("请输入层板距离柜子底部的高度：");
        for (int i = 0; i < n; i++) {
            zs[i] = scanner.nextInt();
        }

        List<List<Integer>> results = moveShelves(n, zs);

        // 按小到大排序
        Collections.sort(results, (a, b) -> {
            for (int i = 0; i < n; i++) {
                if (a.get(i) != b.get(i)) {
                    return a.get(i) - b.get(i);
                }
            }
            return 0;
        });

        System.out.println("所有移动层板的顺序：");
        for (List<Integer> res : results) {
            for (int i = 0; i < n; i++) {
                System.out.print(res.get(i));
                if (i < n - 1) {
                    System.out.print(",");
                }
            }
            System.out.println();
        }
    }

    public static List<List<Integer>> moveShelves(int n, int[] zs) {
        List<List<Integer>> result = new ArrayList<>();

        if (n == 1) {
            List<Integer> singleResult = new ArrayList<>();
            singleResult.add(1);
            result.add(singleResult);
            return result;
        }

        for (int i = 0; i < n; i++) {
            int[] newZs = new int[n - 1];
            int index = 0;
            for (int j = 0; j < n; j++) {
                if (j != i) {
                    newZs[index] = zs[j];
                    index++;
                }
            }

            List<List<Integer>> subResult = moveShelves(n - 1, newZs);

            for (List<Integer> sub : subResult) {
                List<Integer> res = new ArrayList<>();
                res.add(i + 1);
                res.addAll(sub);
                result.add(res);
            }
        }

        return result;
    }
}