Split a number into its digits with Haskell

by

Have you heard of div and mod?

You’ll probably want to reverse the list of numbers if you want to treat the most significant digit first. Converting the number into a string is an impaired way of doing things.

135 `div` 10 = 13
135 `mod` 10 = 5

Generalize into a function:

digs :: Integral x => x -> [x]
digs 0 = []
digs x = digs (x `div` 10) ++ [x `mod` 10]

Or in reverse:

digs :: Integral x => x -> [x]
digs 0 = []
digs x = x `mod` 10 : digs (x `div` 10)

This treats 0 as having no digits. A simple wrapper function can deal with that special case if you want to.

Note that this solution does not work for negative numbers (the input x must be integral, i.e. a whole number).

More Related Contents:

  1. Why give me error? [closed]
  2. What is the difference between . (dot) and $ (dollar sign)?
  3. Good examples of Not a Functor/Functor/Applicative/Monad?
  4. Haskell ranges and floats
  5. Defining a function by equations with different number of arguments
  6. :sprint for polymorphic values?
  7. Small Haskell program compiled with GHC into huge binary
  8. Multi-line commands in GHCi
  9. Writing foldl using foldr
  10. DatatypeContexts Deprecated in Latest GHC: Why?
  11. Why are polymorphic values not inferred in Haskell?
  12. Cabal not installing dependencies when needing profiling libraries?
  13. Library function to compose a function with itself n times
  14. Should do-notation be avoided in Haskell?
  15. Why doesn’t Haskell sequence these IO actions properly?
  16. Why doesn’t this function work if I use “[xs]” instead of “xs”?
  17. What is fusion in Haskell?
  18. Typeclass constraints on data declarations
  19. What does the `forall` keyword in Haskell/GHC do?
  20. How does deriving work in Haskell?
  21. Foldr/Foldl for free when Tree is implementing Foldable foldMap?
  22. What characters are permitted for Haskell operators?
  23. Converting IO Int to Int
  24. Convert String to Integer/Float in Haskell?
  25. Haskell – depth for each node in binary tree using Reader monad
  26. Haskell Constraint is no smaller than the instance head
  27. Can I match a data constructor wildcard in Haskell?
  28. Is there, in Haskell, something similar to sub-guards?
  29. How Monads are considered pure?
  30. What is the Comonad typeclass in Haskell?

Leave a Comment