LeetCode: Unique Paths

Approach 1: Dynamical programming. path[i][j] =
path[i-1][j]+path[i][j-1]. Calculate line by line, can make it use a 1D
array.