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.
Recursive Digit Sum
Recursive Digit Sum
Sort by
recency
|
802 Discussions
|
Please Login in order to post a comment
My solution in Java language. After solved this problem, i believe there is no need to use recursion.
C Codes:
`
python
python solution: def superDigit(n, k): # Write your code here if len(n)<2: return n else: Sum=ksum([int(char) for char in n]) return superDigit(str(Sum), 1)*
Recursive c++ solution