Java > Recursion-1 > count7
prev  |  next  |  chance

Given a non-negative int n, return the count of the occurrences of 7 as a digit, so for example 717 yields 2. (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). count7(717) → 2 count7(7) → 1 count7(123) → 0 ...Save, Compile, Run public int count7(int n) { } See also Java Example Code. Java help docs: If Boolean Logic | Strings | While and For Loops | Arrays and Loops prev  |  next  |  chance   |  CodingBat  >  Recursion-1

Forget It! -- delete my code for this problem 321.0

Copyright Nick Parlante 2006-10 - privacy