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) ...
일부 결과는 사용자가 액세스할 수 없으므로 숨겨졌습니다.
액세스할 수 없는 결과 표시