private static String[] mustExistNumber = new String[] { "1", "2", "2", "3", "4", "5" };
private static boolean isValidNumber(String str) {
// 检查是否包含12345这五个数,不包含返回false
for (String number : mustExistNumber) {
if (str.indexOf(number) < 0)
return false;
}
// 检查是否有两个2,只有一个返回false
if (str.lastIndexOf("2") == str.indexOf("2")) {
return false;
}
// 检查4在不在第三位,是返回false
if (str.charAt(2) == '4') {
return false;
}
// 检查是否存在35在一起,有返回false
if (str.indexOf("35") >= 0 || str.indexOf("53") >= 0) {
return false;
}
return true;
}
public static void main(String[] args) {
int count=0;
for (int i = 122345; i <=543221; i++) {
if (isValidNumber(String.valueOf(i))) {
System.out.println(i);
count++;
}
}
System.out.println(count);
}
输出前增加判断
public static int count=0;
public static void main(String[] args) throws Exception{
long startTime = System.currentTimeMillis(); //获取开始时间
// String[] array=new String[]{"1","2","2","3","4","5"};
// listAll(Arrays.asList(array),"");
String s = "122345";
listAll(Arrays.asList(s.split("")),"");
System.out.println(count);
long endTime = System.currentTimeMillis(); //获取结束时间
System.out.println("程序运行时间:" + (endTime - startTime) + "ms"); //输出程序运行时间
}
private static void listAll(List<String> candidate, String prefix) {
if(candidate.isEmpty()) {
if(prefix.charAt(2)=='4'||prefix.contains("35")||prefix.contains("53")){
return;
}
System.out.println(prefix);
count++;
}else {
StringBuilder sb=new StringBuilder();//记录前面已经出现的字符
for (int i = 0; i < candidate.size(); i++) {
if(sb.indexOf(candidate.get(i))!=-1){//如果是重复字符就不递归
continue;
}
List temp = new LinkedList(candidate);//为了方便提取后删除每个元素
listAll(temp, prefix + temp.remove(i));
sb.append(candidate.get(i));
}
}
}
另一种方法
public static Set<String> set = new TreeSet<String>();
public static void perm(char[] n, int beg, int end) {//最后一位交换与后面每位交换,对新串递归
if (beg == end) {
addNumber(String.valueOf(n));
} else {
for (int i = beg; i <= end; ++i) {
swap(n, beg, i);
perm(n, beg + 1, end);
swap(n, beg, i);
}
}
}
public static void swap(char[] n, int x, int y) {//交换
if (x == y || n[x] == n[y]) {
return;
}
char temp = n[x];
n[x] = n[y];
n[y] = temp;
}
public static void addNumber(String str) {//如果第三位是4,或者3、5相连,不添加到集合中
if (str.charAt(2) == '4' || str.contains("35") || str.contains("53")) {
return;
}
set.add(str);
}
public static void main(String args[]) {
char[] number = new char[] { '1', '2', '2', '3', '4', '5' };
perm(number, 0, number.length - 1);
System.out.println(set.size());
int cols = 10;
for (String s : set) {
System.out.print(s + " ");
if (cols-- == 1) {
System.out.println();
cols = 10;
}
}
}
转自 https://blog.csdn.net/zxm1306192988/article/details/74275954