title: Recursive method to find the number of appereances in a number
body: <pre><code>public static boolean countExactly(int num, int digit, int count) {
      if(digit &lt;= 9) {
          return false;
      }
      if(num % 10 == digit) {
          countExactly(num % 10 + num / 10, digit, count++);
      }
      return true;
  }
  </code></pre>
  
  <p>What's wrong with my code???
  I'm trying to write a recursive method to find the number of appereances in a number.
  Write a recursive function that encodes a positive integer num, Spain digit from another integer
  No Negative Counting. The function returns true if the digit number appears exactly number number
  Count times, otherwise return false.</p>
  
  <p>Example:input:122231 digit:2 count:3 output:true</p>