Need help with a haskell problem thats doing my head in. I know the steps (sorta) that need to be taken to achieve want I want but I don't really know how to go about doing it.
E.g
Say I have a lists of Maybe Int's - [[Just 2, Nothing, Just 3],[Just 6,Just 3, Just 3],[Nothing,Nothing, Just 1]]
I need to create a function that.
1) Takes lists of Maybe Ints
[[Just 2, Nothing, Just 3],[Just 6,Just 3, Just 3],[Nothing,Nothing, Just 1]]
2) Gets First List (head?)
[Just 2, Nothing, Just 3]
3) Recurse through each element within the list - (x:xs)
Just 2, Nothing, Just 3
4) convert Maybe Int to a Char - fromEnum
'2', ' ', '3'
5) return the complete String containing all the chars - (++) = [char] / String
"2 3"
6) move onto the next List until list = []
[Just 6,Just 3, Just 3]
So the end result would be something like this printed out on a separate line:
"2 3"
"633"
" 1"
I tried to explain it as well as possible and any tips / helps / sources of information would be appreciated.