2018-10-10 22:03:03 +00:00
|
|
|
|
---
|
|
|
|
|
id: 5900f3741000cf542c50fe87
|
2020-12-16 07:37:30 +00:00
|
|
|
|
title: 问题8:系列中最大的产品
|
2018-10-10 22:03:03 +00:00
|
|
|
|
challengeType: 5
|
|
|
|
|
videoUrl: ''
|
|
|
|
|
---
|
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
# --description--
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
具有最大乘积的1000位数字中的四个相邻数字是9×9×8×9 = 5832。
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
73167176531330624919225119674426574742355349194934
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
96983520312774506326239578318016984801869478851843
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
85861560789112949495459501737958331952853208805511
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
12540698747158523863050715693290963295227443043557
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
66896648950445244523161731856403098711121722383113
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
62229893423380308135336276614282806444486645238749
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
30358907296290491560440772390713810515859307960866
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
70172427121883998797908792274921901699720888093776
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
65727333001053367881220235421809751254540594752243
|
|
|
|
|
|
|
|
|
|
52584907711670556013604839586446706324415722155397
|
|
|
|
|
|
|
|
|
|
53697817977846174064955149290862569321978468622482
|
|
|
|
|
|
|
|
|
|
83972241375657056057490261407972968652414535100474
|
|
|
|
|
|
|
|
|
|
82166370484403199890008895243450658541227588666881
|
|
|
|
|
|
|
|
|
|
16427171479924442928230863465674813919123162824586
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
17866458359124566529476545682848912883142607690042
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
24219022671055626321111109370544217506941658960408
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
07198403850962455444362981230987879927244284909188
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
84580156166097919133875499200524063689912560717606
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
05886116467109405077541002256983155200055935729725
|
|
|
|
|
|
|
|
|
|
71636269561882670428252483600823257530420752963450
|
|
|
|
|
|
|
|
|
|
找到具有最大乘积的1000位数字中的`n`相邻数字。这个产品有什么价值?
|
|
|
|
|
|
|
|
|
|
# --hints--
|
|
|
|
|
|
|
|
|
|
`largestProductinaSeries(4)`应该返回5832。
|
2018-10-10 22:03:03 +00:00
|
|
|
|
|
|
|
|
|
```js
|
2020-12-16 07:37:30 +00:00
|
|
|
|
assert.strictEqual(largestProductinaSeries(4), 5832);
|
2018-10-10 22:03:03 +00:00
|
|
|
|
```
|
2020-08-13 15:24:35 +00:00
|
|
|
|
|
2020-12-16 07:37:30 +00:00
|
|
|
|
`largestProductinaSeries(13)`应返回23514624000。
|
|
|
|
|
|
|
|
|
|
```js
|
|
|
|
|
assert.strictEqual(largestProductinaSeries(13), 23514624000);
|
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
# --solutions--
|
|
|
|
|
|