More like Badskell

gistfile1.txt

-- I am probably overcomplicating basic haskell

-- toDigits <=0 = []
-- toDigits 1230 = [1,2,3,0]


numDigits :: Integer -> Integer
numDigits n
    | n <= 9 = 0
    | otherwise = 1 + numDigits (n `div` 10)


trueToDigits :: Integer -> [Integer]
trueToDigits n
    | n < 10 = n : []
    | otherwise = n `div` (10 ^ numDigits n) : trueToDigits (n  `mod` (10 ^ numDigits n))

toDigits :: Integer -> [Integer]
toDigits n
    | n <= 0 = []
    | otherwise = trueToDigits n