(超级无敌重要,背下来背下来)Leetcode(46,47,78,90,39,40)dfs和回溯(全排列)
简单的打印全排列:dfs,用标记数组used标记是否用过
package leetcode160;
public class queue {
static int count=0;
public static void main(String[] args) {
char[] chs= {'a','b','c'};
int[] used=new int[3];
char[] t...
原创
2019-10-13 12:23:20 ·
189 阅读 ·
0 评论