private void copyArray(char[] src, char[] destiny) {
    for (int i = 0; i < src.length; i++) {
      destiny[i] = src[i];
    }
  }
Iterative solution to this problem. Using two pointer we are going to iterate over the input
array using one of them and other to store the result in a temporal array. The complexity
order of this algorithm in time and space terms is O(N) where N is the number of elements in
the array.
src/main/java/com/github/pedrovgs/problem52/ReplaceSpaces.java