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.
public static int superDigit(String n, int k) {
if(n.length()==1) return Integer.parseInt(n);
int sum=0;
for(char c:n.toCharArray()){
sum+=(int)(c-48);
}
return superDigit(sum*(k%9)+"",1);
}
*/
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Recursive Digit Sum
You are viewing a single comment's thread. Return to all comments →
this code also work for all test:
public static int superDigit(String n, int k) { if(n.length()==1) return Integer.parseInt(n); int sum=0; for(char c:n.toCharArray()){ sum+=(int)(c-48);
} return superDigit(sum*(k%9)+"",1); } */