1. 题目介绍

https://leetcode-cn.com/problems/unique-paths/

2. 解题代码

    public int UniquePaths(int m, int n) {
        int[,] f=new int[m,n];
        int i,j;
        for (i = 0; i < m; i++)
        {
            for (j = 0; j < n; j++)
            {
                if (i == 0 || j == 0)
                {
                    f[i,j]=1;
                }
                else
                {
                    f[i,j]=f[i-1,j]+f[i,j-1];
                }
            }
        }
        return f[m-1,n-1];
    }