First version of the unique path II problem.

Not yet an elegant solution.
Second version of the unique path II problem.

Space complexity is O(m) , and time complexity is O(mn). Still not a very elegant solution, codes are patched to initialize and to handle special cases