I almost forgot I started this ‘series’… Sorry!

Now, with some time at hand, lets look at the problem number three, from the Scala 99 Problems. Like problem number one and two, this one is about list manipulations. It says:

**P03 (*) Find the ***K*th element of a list.
- By convention, the first element in the list is element 0.Example:
scala> nth(2, List(1, 1, 2, 3, 5, 8))
res0: Int = 2

- First, the obvious solution, taking advantage of the List API:

def nth[A](n: Int, list: List[A]): A = {
list(n)
}

- This is the kind of code you should be using. But we can try to be a little bit clever and solve the problem in a different way, to explore a little more the features of the scala language, pattern matching in this case:

def nth[A](n: Int, list: List[A]): A = list match {
case x :: tail if n == 0 => x
case x :: tail => nth(n-1, tail)
case _ => throw new IllegalStateException("cannot find element n")
}

My algorithm here is probably not very interesting – but the pattern matching usage is the point. Its flexibility always impresses me!

Finally, take a look at the original solution here. It seems the solution is similar to mine, exception it takes care of invalid situations better than I am. Anyway, nice stuff.

### Like this:

Like Loading...