gpt4 book ai didi

连续产品的Scala解决方案

转载 作者:行者123 更新时间:2023-12-05 00:56:02 24 4
gpt4 key购买 nike

我正在使用 Scala 解决一个问题,我的解决方案是:

object ConsecutiveProduct extends App {

def getConsecutiveProduct(group: Int, number: String): Int = {
val result = number.sliding(group).map(product)

result.max
}

def product(number: String): Int = number.map(_.asDigit).product

val str = """73167176531330624919225119674426574742355349194934
|96983520312774506326239578318016984801869478851843
|85861560789112949495459501737958331952853208805511
|12540698747158523863050715693290963295227443043557
|66896648950445244523161731856403098711121722383113
|62229893423380308135336276614282806444486645238749
|30358907296290491560440772390713810515859307960866
|70172427121883998797908792274921901699720888093776
|65727333001053367881220235421809751254540594752243
|52584907711670556013604839586446706324415722155397
|53697817977846174064955149290862569321978468622482
|83972241375657056057490261407972968652414535100474
|82166370484403199890008895243450658541227588666881
|16427171479924442928230863465674813919123162824586
|17866458359124566529476545682848912883142607690042
|24219022671055626321111109370544217506941658960408
|07198403850962455444362981230987879927244284909188
|84580156166097919133875499200524063689912560717606
|05886116467109405077541002256983155200055935729725
|71636269561882670428252483600823257530420752963450""".filter(_.isDigit)
println(getConsecutiveProduct(5, str))
}

因此,根据问题,必须计算最高相邻位数的乘积,对于具有最高乘积的 5 个相邻位数的输入,我得到的结果正确为 40824 ,但是根据问题,当我在这里通过 13 时 println(getConsecutiveProduct(13, str)) 即连续 13 位数的最高乘积我得到结果为'2091059712',但它不是正确的答案,因为我试图在相应的网站中输入,我尝试调试但找不到我做错的地方,请有人帮忙。

最佳答案

寻求的产品超过 32 位整数,因此存在溢出。使用 Long反而。这包括 asDigit 的结果同样,即:

number.map(_.asDigit.toLong).product

关于连续产品的Scala解决方案,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/36976947/

24 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com