Hackerrank – List Replication
Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
object ListReplication extends App { def f(num: Int, arr: List[Int]): List[Int] = if (arr.isEmpty) Nil else List.fill(num)(arr.head) ::: f(num, arr.tail) def f2(num: Int, arr: List[Int]): List[Int] = arr match { case x :: xs => List.fill(num)(x) ::: f2(num, xs) case Nil => Nil } def displayResult(arr: List[Int]) = println(f(arr(0).toInt, arr.drop(1)).map(_.toString).mkString("\n")) displayResult(io.Source.stdin.getLines.toList.map(_.trim).map(_.toInt)) } |
Riešenie dostupné na mojom GitHub profile.