YogenGhodke
5/12/2020 - 10:56 AM

Permutations

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;

public class Permu {

    static ArrayList al = new ArrayList();
    static String last = "";


    static void printPermutn(String str, String ans)
    {

        // If string is empty
        if (str.length() == 0) {
            last = last + " " + ans;
            return;
        }

        for (int i = 0; i < str.length(); i++) {

            // ith character of str
            char ch = str.charAt(i);

            // Rest of the string after excluding
            // the ith character
            String ros = str.substring(0, i) +
                    str.substring(i + 1);

            // Recurvise call
            printPermutn(ros, ans + ch);
        }
    }




    static String convert(int[] x)
    {
        String c = "";
        for(int i=0; i < x.length; i++)
        {
            c = c + x[i];
        }
        return c;
    }


    public static void main(String[] args) {

        int[] x = {1,1,3};
        printPermutn(convert(x),"");

        for(String retval: last.split(" "))
            {
                al.add(retval);
            }
        al.sort(Comparator.reverseOrder());
        al.removeAll(Collections.singleton(""));
        System.out.println(al);


    }


}