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
|
805 Discussions
|
Please Login in order to post a comment
long tinhTong(string n) { long sum = 0;
}
long superDigit(string n, int k) { long N = tinhTong(n) * k;
}
java 8
public static int superDigit(String n, int k) { // Write your code here int val=0; if(n.length()==1){
}
My python solution:
My solution in Java language. After solved this problem, i believe there is no need to use recursion.
C Codes:
`