You are viewing a single comment's thread. Return to all comments →
My code, Java 15:
public static int result(int n){ Stack<Integer> s = new Stack<>(); int bestVal = 1; int bestSum = 1; for(int i = 1; i <= (int)Math.sqrt(n); i++){ if(n % i == 0){ int sum = sumDigit(i); s.push(n / i); if(bestSum < sum){ bestSum = sum; bestVal = i; } } } while(!s.isEmpty()){ int val = s.pop(); int sum = sumDigit(val); if(bestSum < sum){ bestSum = sum; bestVal = val; } } return bestVal; } public static int sumDigit(int val){ int sum = 0; while (val > 0){ sum += val % 10; val /= 10; } return sum; }
Seems like cookies are disabled on this browser, please enable them to open this website
Best Divisor
You are viewing a single comment's thread. Return to all comments →
My code, Java 15: