Wait, you want to use factorials or you want to use recursion? A factorial-based approach would involve mapping 0.. (n! - 1) to different permutations. A recursive approach (which is what I would use) ...
当前正在显示可能无法访问的结果。
隐藏无法访问的结果当前正在显示可能无法访问的结果。
隐藏无法访问的结果