private void addCharCounterIfNeeded(StringBuilder sb, int charCounter) {
    if (charCounter > 1) {
      sb.append(charCounter);
    }
  }
Tail recursive solution to this problem. The complexity order in time and space terms of this
recursive version is the same than te previous one.
src/main/java/com/github/pedrovgs/problem53/CompressString.java