• Home
• io.github.changebooks
• optimal-permutation
• 1.0.3
• source code
• Permutations.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

io.github.changebooks.optimal.permutation.Permutations Maven / Gradle / Ivy

package io.github.changebooks.optimal.permutation;

/**
 * 生成数组下标的全排列
 * 
 *   数组长度：1
 *   数组下标：[0]
 * 下标全排列：[0]
 * 
 * 
 *   数组长度：2
 *   数组下标：[0, 1]
 * 下标全排列：[0, 1], [1, 0]
 * 
 * 
 *   数组长度：3
 *   数组下标：[0, 1, 2]
 * 下标全排列：[0, 1, 2], [0, 2, 1], [1, 0, 2], [1, 2, 0], [2, 0, 1], [2, 1, 0]
 * 
 *
 * @author [email protected]
 */
public interface Permutations {

    /**
     * 按指定数组长度（size），生成数组下标，并全排列该下标
     * 如，
     * 
     *     指定数组长度：3
     *   生成的数组下标：[0, 1, 2]
     * 数组下标的全排列：[0, 1, 2], [0, 2, 1], [1, 0, 2], [1, 2, 0], [2, 0, 1], [2, 1, 0]
     * 
     * 
     * (size = 0) : []
     * (size = 1) : [ [0] ]
     * (size = 2) : [ [0, 1], [1, 0] ]
     * (size = 3) : [ [0, 1, 2], [0, 2, 1], [1, 0, 2], [1, 2, 0], [2, 0, 1], [2, 1, 0] ]
     * ... ...
     * 
     *
     * @param size 指定数组长度
     * @return 数组下标的全排列
     */
    int[][] compute(int size);

}