欧拉项目第8题 Largest product in a series
来源:互联网 发布:淘宝注册网址 编辑:程序博客网 时间:2024/06/02 05:38
The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450
Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?
求这组数中,连续13个一位数的乘积最大值
把这段字符串对0进行截取,对每个字符进行运算,求最大值
public static void main(String[] args) {
String[] x = ("73167176531330624919225119674426574742355349194934"+
"96983520312774506326239578318016984801869478851843"+
"85861560789112949495459501737958331952853208805511"+
"12540698747158523863050715693290963295227443043557"+
"66896648950445244523161731856403098711121722383113"+
"62229893423380308135336276614282806444486645238749"+
"30358907296290491560440772390713810515859307960866"+
"70172427121883998797908792274921901699720888093776"+
"65727333001053367881220235421809751254540594752243"+
"52584907711670556013604839586446706324415722155397"+
"53697817977846174064955149290862569321978468622482"+
"83972241375657056057490261407972968652414535100474"+
"82166370484403199890008895243450658541227588666881"+
"16427171479924442928230863465674813919123162824586"+
"17866458359124566529476545682848912883142607690042"+
"24219022671055626321111109370544217506941658960408"+
"07198403850962455444362981230987879927244284909188"+
"84580156166097919133875499200524063689912560717606"+
"05886116467109405077541002256983155200055935729725"+
"71636269561882670428252483600823257530420752963450").split("0");
long p = 1;
int length = 13;//连续位数
for(String i : x) {
if(i.length() >= length) {//字符串位数大于连续数
char[] oo = i.toCharArray();
for(int ix=0;ix<=oo.length-length;ix++){
long xh=1;
for(int j =0;j<length;j++){
xh = xh * (oo[ix + j] - 48);//char 转 int
}
if(p < xh)
p = xh;
}
}
}
System.out.println(p);
}
- 欧拉项目第8题 Largest product in a series
- 欧拉计划(8)Largest product in a series
- 欧拉项目第11题 Largest product in a grid
- Problem 8:Largest product in a series
- Problem 8:Largest product in a series
- Problem 8:Largest product in a series
- PE 8 Largest product in a series
- Problem 8 Largest product in a series
- 【Project Euler】【Problem 8】Largest product in a series
- project euler problem 8:Largest product in a series
- projecteuler---->problem=8----Largest product in a series
- 8 Largest product in a series - Project Euler
- Problem 8 Largest product in a series (暴力)
- Project Euler Problem 8: Largest product in a series
- project euler 8 Largest product in a series
- 欧拉计划(11)Largest product in a grid
- Project Euler 008 Largest product in a series
- 欧拉项目第四题 Largest palindrome product
- MVVM 介绍----朱宏旭
- Xcode工程调试报错问题整理
- 开发命令
- Xcode-工程添加预编译头文件Prefix.pch
- 【IOS沉思录】IOS开发键盘显示、隐藏事件实现输入框调整防止键盘遮挡
- 欧拉项目第8题 Largest product in a series
- IntelliJ IDEA中怎么查看文件中所有方法(类似eclipse里面的outline)
- 51822代码篇2
- jsonp解决跨域问题
- UITableView和NavigationBar的常用设置
- IOS底部导航设置与页面多级跳转
- 工厂方法
- UIKit-boundingRectWithSize计算多行UILabel的文字高度
- UIKit-UIView常用设置