Update Uniform_Integers.py

[tofes]

More efficient solution with simpler code.

[justin-qu]

Great solution, the code is certainly much simpler. Unfortunately, O(9 * log10(B)) is not algorithmically more efficient.

The current solution is O(log10(A) + log10(B)). In the worst case, when A = B, we get O(log10(B) + log10(B)), which is equivalent to O(2 * log10(B)).

[tofes]

Good point on the detailed time complexity analysis, the proposed solution is slightly more indeed. However the original solution has high readability and implementation costs. The proposed solution is easier to understand and quicker to implement within a time constraint. Both solutions' time complexity are acceptable (max O(108)) which represent negligible differences. Considering the overall advantages, the proposed solution is likely to be adopted by more users, thereby enhancing the value of this repository.