| about | help | code help+videos | done | prefs |
Write a RECURSIVE method that returns the product of all the digits of 'num'. As a precondition you may assume that num>0. Your method MUST solve this problem recursively, without using any loops of any kind. feb13_2020_SLHL_recursiveDigitMultiply(1) → 1 feb13_2020_SLHL_recursiveDigitMultiply(7) → 7 feb13_2020_SLHL_recursiveDigitMultiply(70) → 0 ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 390
Copyright Nick Parlante 2017 - privacy