We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Functional Programming
  3. Introduction
  4. Reverse a List
  5. Discussions

Reverse a List

Sort 102 Discussions, By:

  • FlavioFernandes4
     + 3 comments

    Scala:

    arr.foldLeft(List[Int]())((acc,v) => v::acc)

  • __spartax
     + 8 comments
    rev [] = []
rev (h:t) = rev t ++ [h]

  • luizpericolo
     + 3 comments

    My Scala solution:

    def f(arr:List[Int]):List[Int] = {
    def revList(orig: List[Int], rev: List[Int]): List[Int] = {
        orig match {
            case Nil => rev
            case x::xs => revList(xs, x :: rev)
        }
    }
    revList(arr, Nil)
}

  • rudaliszka
     + 1 comment

    In Clojure: (fn [lst] (reduce conj '() lst))

  • chrissphinx
     + 1 comment

    Not enough Elixir love:

    IO.stream(:stdio, :line)
|> Enum.map(&String.trim/1)
|> Enum.reduce([], &([&1 | &2]))
|> Enum.each(&IO.puts/1)
Load more conversations