# 32 Pandigital products - Project Euler -

105人阅读 评论(0)

package xxx.xxx.xxx;

import java.util.ArrayList;
import java.util.HashSet;

/*
* We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once; for example, the 5-digit number, 15234, is 1 through 5 pandigital.

The product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital.

Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through 9 pandigital.

HINT: Some products can be obtained in more than one way so be sure to only include it once in your sum.
*/
public class PandigitalProducts {

private static char[] is = new char[] { '1', '2', '3', '4', '5', '6', '7',
'8', '9' };
private static int total;
private static int m = 9;
private HashSet<Integer> products = new HashSet<Integer>();

private void plzh(String s, ArrayList<Integer> iL, int m) {
if (m == 0) {
// System.out.println(s);
this.isPandigitalEquation(s);
total++;
return;
}
ArrayList<Integer> iL2;
for (int i = 0; i < is.length; i++) {
iL2 = new ArrayList<Integer>();
if (!iL.contains(i)) {
String str = s + is[i];
plzh(str, iL2, m - 1);
}
}
}

/*
* 1位数*4位数的结果：最短4位数，最长5位数
* 2位数*2位数的结果：最短3位数，最长4位数
* 2位数*3位数的结果：最短4位数，最长5位数
* 2位数*4位数的结果：最短5位数，最长6位数
*/
private void isPandigitalEquation(String str){
int a = Integer.valueOf(str.substring(0, 1));
int b = Integer.valueOf(str.substring(1, 5));
int c = Integer.valueOf(str.substring(5));
if(a*b==c){
}else{
int a1 = Integer.valueOf(str.substring(0, 2));
int b1 = Integer.valueOf(str.substring(2, 5));
int c1 = Integer.valueOf(str.substring(5));

if(a1*b1==c1){
}
}
}

private int isPandigitalEquation3(String str){

int a = Integer.valueOf(str.substring(0, 1));
int b = Integer.valueOf(str.substring(1, 4));
int c = Integer.valueOf(str.substring(4));

if(a*b==c){
System.out.println(str);
System.out.println(c);
return c;
}else{
int a1 = Integer.valueOf(str.substring(0, 2));
int b1 = Integer.valueOf(str.substring(2, 5));
c = Integer.valueOf(str.substring(5));

if(a1*b1==c){
System.out.println(str);
System.out.println(c);
return c;
}
}

return 0;
}

public static void main(String[] args) {
/*
long startTime = System.currentTimeMillis();
ArrayList<Integer> iL = new ArrayList<Integer>();
new PandigitalProducts().plzh("", iL, m);
System.out.println("total : " + total);
long endTime = System.currentTimeMillis();
System.out.println("execution time " + (endTime - startTime + "ms"));
*/

long startTime = System.currentTimeMillis();
ArrayList<Integer> iL = new ArrayList<Integer>();
PandigitalProducts p =new PandigitalProducts();
p.plzh("", iL, m);

HashSet<Integer> temp = p.products;
System.out.println(temp);
int sum = 0;
for(int t:temp){
sum+=t;
}
System.out.println(sum);
long endTime = System.currentTimeMillis();
System.out.println("execution time " + (endTime - startTime + "ms"));
}

}
0
0

【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐（算法+实战）--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：6840次
• 积分：320
• 等级：
• 排名：千里之外
• 原创：26篇
• 转载：4篇
• 译文：0篇
• 评论：4条
阅读排行
最新评论