Add solution to problem 38. It's more like Java code rather than Scala code. But, the result is quite good. 0.43s for sample case, 0.51s for worst case on hackerrank. There is another optimization for this code, move the digitAppeared Array outside the canBePandigitalMultiples function, so we won't create a new array for every function call. But may be not worse the effort.
Add solution to problem 38. It's more like Java code rather than Scala code.
But, the result is quite good. 0.43s for sample case, 0.51s for worst case on
hackerrank. There is another optimization for this code, move the digitAppeared
Array outside the canBePandigitalMultiples function, so we won't create a new
array for every function call. But may be not worse the effort.

advancedxy/hackerrank,advancedxy/hackerrank,advancedxy/hackerrank