Algorithm n次K数的最佳算法
我最近提出了一个问题Algorithm n次K数的最佳算法,algorithm,optimization,Algorithm,Optimization,我最近提出了一个问题 查找包含数字k或可被k整除的第n个数字。（2与haskell > filter (\x -> hasDigit 3 x || mod x 3 == 0) [1..100] [3,6,9,12,13,15,18,21,23,24,27,30,31,32,33,34,35,36,37,38,39,42,43,45,48,51,53,5 4,57,60,63,66,69,72,73,75,78,81,83,84,87,90,93,96,99] 您可以将hasDig
查找包含数字k或可被k整除的第n个数字。（2与
haskell> filter (\x -> hasDigit 3 x || mod x 3 == 0) [1..100]
[3,6,9,12,13,15,18,21,23,24,27,30,31,32,33,34,35,36,37,38,39,42,43,45,48,51,53,5
4,57,60,63,66,69,72,73,75,78,81,83,84,87,90,93,96,99]
> hasDigit k n = elem (head $ show k) $ show n
很好的精确解释。