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.
Loading...
  1. Practice
  2. Functional Programming
  3. Introduction
  4. Reverse a List
  5. Discussions

Reverse a List

  • luizpericolo + 2 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)
}
    • xavier_guihot + 0 comments
      [deleted]
    • MartinRosenberg + 0 comments

      If you're going to use tail recursion in Scala, you need to annotate the helper function with @tailrec.