Hackerrank – Reverse a list

26. apríla 2017 Pavol PidaničComments are off for this post.

Popis problému
Celý popis zadania sa nacháza – Hackerrank.

Riešenie

object ReverseList extends App {
  def f(arr: List[Int]): List[Int] =
    (arr.foldLeft(List.empty[Int])((list, e) => e :: list))
}

object ReverseList extends App {

def f(arr: List[Int]): List[Int] =

(arr.foldLeft(List.empty[Int])((list, e) => e :: list))

}

Riešenie tiež dostupnén na mojom GitHub profile.