解题思路:
注意事项:
参考代码:
//import java.util.HashSet;
import java.util.TreeSet;
public class Main {
public static void main(String[] args) {
int m=123;
while(m<333) {
int n=2*m;
int p=3*m;
String str=""+m+n+p;
//HashSet<String> set=new HashSet<String>();
TreeSet<String> noReapted=new TreeSet<String>();
for(int i=0;i<str.length();i++) {
//set.add(""+str.charAt(i));
noReapted.add(""+str.charAt(i));}
noReapted.remove(""+"0");
//set.remove(""+"0");
if(noReapted.size()==9)
System.out.println(m+" "+n+" "+p);
//if(set.size()==9)
//System.out.println(" "+m+" "+n+" "+p);
m++;
}
}
}
0.0分
0 人评分