Java-如何查找一维数组中所有值的排列并将它们存储在二维数组中

Question

I want to create a method in which, when given a 1 dimensional array, it'll find all permutations of the values in that array and make it into a 2 dimensional array. I found some algorithms online which finds all the permutations but only prints the values out in the form of a 2d array( example ), but I couldn't quite modify the code to store the output into a single 2d array. Any help would be appreciated, thank you.

Answer 1

Here's how I would do it - adapted from the link in your question:

import java.util.List;
import java.util.LinkedList;
import java.util.Iterator;

// Java program to calculate all permutations using 
// Heap's algorithm 
class HeapAlgo 
{ 
    List<int[]> heapPermutation(int a[]) {
        LinkedList<int[]> list = new LinkedList<int[]>();
        heapPermutation(a, a.length, a.length, list);
        return list;
    }

    //Generating permutation using Heap Algorithm 
    void heapPermutation(int a[], int size, int n, List<int[]> list) 
    { 
        // if size becomes 1 then adds the obtained 
        // permutation to the list
        if (size == 1) 
            list.add(a.clone());

        for (int i=0; i<size; i++) 
        { 
            heapPermutation(a, size-1, n, list); 

            // if size is odd, swap first and last 
            // element 
            if (size % 2 == 1) 
            { 
                int temp = a[0]; 
                a[0] = a[size-1]; 
                a[size-1] = temp; 
            } 

            // If size is even, swap ith and last 
            // element 
            else
            { 
                int temp = a[i]; 
                a[i] = a[size-1]; 
                a[size-1] = temp; 
            } 
        } 
    } 

    // Driver code 
    public static void main(String args[]) 
    { 
        HeapAlgo obj = new HeapAlgo(); 
        int a[] = {1,2,3}; 
        List<int[]> list = obj.heapPermutation(a);
        for(Iterator<int[]> i = list.iterator(); i.hasNext();) {
            int[] array = i.next();
            for(int j = 0; j < array.length; j++) {
                System.out.print(array[j] + " ");
            }
            System.out.println();
        }
    } 
} 

// Based on code contributed by Amit Khandelwal.

Another approach would be to create an array of int[] arrays. The length would be the factorial of the length of a . You could create a stack class that tracks the lowest empty index to add the next permutation to.