最近研究算法,突然想起了列出字符串的所有排列的算法题,就研究了下。要求列出所有长度的,不重复的字符串。如字符串ab,列出a, b, ab, ba.
直接上代码吧。
private List<String> printArrangement(String str) {
if (str == null)
return null;
List<String> allStrList = new ArrayList<String>();
String[] charArr = new String[str.length()];
for (int j = 0; j < str.length(); j++) {
charArr[j] = str.substring(j, j+1);
allStrList.add(String.valueOf(charArr[j]));
}
StringBuilder builder = new StringBuilder();
int minSize = 0;
int maxSize = 0;
for (int n = 1; n < str.length(); n++) {
minSize = maxSize;
maxSize = allStrList.size();
for (int i = 0; i < charArr.length; i++) {
for (int j = minSize; j < maxSize; j++) {
if (allStrList.get(j).contains(charArr[i])) {
continue;
}
builder.delete(0, builder.length());
builder.append(charArr[i]);
builder.append(allStrList.get(j));
allStrList.add(builder.toString());
}
}
}
return allStrList;
}