import java.util.*; /** * 给定参数n,从1到n会有n个整数1,2,3,...,n这n个数组共有n!种排列,按照大小顺序升序排列出所有列的情况,并一一标记, *给定n和k返回第k个值, */ public class Main { public static void cal(char data[], int k, List<String> list) { if (k == data.length) { String s = ""; for (int i = 0; i < data.length; i++) { s += data[i]+""; } list.add(s); } for (int i = k; i < data.length; i++) { { char temp = data[k]; data[k] = data[i]; data[i] = temp; } cal(data, k + 1,list); { char temp = data[k]; data[k] = data[i]; data[i] = temp; } } }
【每天一道算法题】给定参数n,从1到n会有n个整数1,2,3,...,n这n个数组共有n!种排列,按照大小顺序升序排列出所有列的情况,并一一标记,给定n和k返回第k个值
最新推荐文章于 2022-11-28 17:43:53 发布