-
Notifications
You must be signed in to change notification settings - Fork 0
/
JianZhi027.java
37 lines (36 loc) · 976 Bytes
/
JianZhi027.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
import java.util.concurrent.atomic.AtomicStampedReference;
/**
* @ProjectName: LeetCode
* @Author: XinyuLiu
* @Description:
*/
public class JianZhi027 {
//1.回溯,两两交换(Set去重)
Set<String> set = new HashSet<>();
public String[] permutation(String s) {
char[] chars = s.toCharArray();
dfs(chars,0);
return set.toArray(new String[set.size()]);
}
public void dfs(char[] chars,int i){
if(i == chars.length - 1){
set.add(String.valueOf(chars));
return;
}
for (int j = i; j < chars.length; j++) {
swap(chars,i,j);
dfs(chars,i + 1);
swap(chars,j,i);
}
}
public void swap(char[] chars,int i,int j){
char tmp = chars[i];
chars[i] = chars[j];
chars[j] = tmp;
}
}