leetcode

Unique path解题，核心思想是动态规划，还有就是减少空间复杂度问题。class Solution {    int uniquePaths(int m, int n) {        if (m > n) return uniquePaths(n, m);        vector<int> cur(m, 1);        for (int j = 1; j < n; j++)            for (int i = 1; i < m; i++)                cur[i] += cur[i - 1];         return cur[m - 1];    }};