LeetCode: Minimum Path Sum

Approach 1: Dynamical programming. 2D array. Maybe can use 1D array to
reduce memory usage.