| about | help | code help+videos | done | prefs |
Given a non-negative int n, return the number of its digits that are equal to 1 recursively (no loops). Note that mod (%) by 10 yields the rightmost digit (126 % 10 is 6), while divide (/) by 10 removes the rightmost digit (126 / 10 is 12). countOnes(121) → 2 countOnes(49) → 0 countOnes(12181) → 3 ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Copyright Nick Parlante 2017 - privacy