倍逆序式

2019独角兽企业重金招聘Python工程师标准>>>

import java.util.Scanner;

public class Testa {

public static void main(String[] args) {
	System.out.println("请输入n:(代表求多少个连续的合数)");
	Scanner reader=new Scanner(System.in);
	int n=reader.nextInt();
	int min=(int) Math.pow(10,n-1);
	int max=(int) (Math.pow(10,n)-1);
	int total=0;
   for(int i=min;i<max;i++){
	   boolean x=f(i);
	   if(x){
		   boolean ok=k(i);
		   if(ok){
			   System.out.println("符合条件:"+i);
		   }
		   
	   }
   }
 }	
	

//去重

public static boolean f(int n){

	String result=String.valueOf(n);
	
	int length=result.length();
	
	for(int i=0;i<length-1;i++){
		for(int j=i+1;j<length;j++){
			char a=result.charAt(i);
			char b=result.charAt(j);
			if(a==b){
				return false;
			}
		}
	}
	
	return true;
	
}


 //将数逆序,n代表传入的数

public static boolean k(int n){
	
	int m=n;
	String result=String.valueOf(m);
	int leng=result.length()-1;
	int length=leng;
	int temp;
	int sum;
	sum=0;
	
	temp=m%10;
	sum =(int) (sum+Math.pow(10,leng)*temp);
	
	m=m/10;
	
	while(m>=10){
		temp=m%10;
		leng--;
		sum=(int) (sum+Math.pow(10,leng)*temp);
		m=m/10;
	}
	leng--;
	sum=(int) (sum+Math.pow(10,leng)*m);
     String result1=String.valueOf(sum);
     int length1=result1.length();
     if(n<sum){
    	 int k=sum/n;
    	 if(k*n==sum){
    		 return true;
    	 }
     }
	return false;
	
}

}

转载于:https://my.oschina.net/u/2511906/blog/847272