Sharing my C# solution DP


  • 0
    Y
    public class Solution {
        public int UniquePaths(int m, int n) {
            
            var DP=new int[m,n];
            
            DP[0,0] = 1;
            
            for(int i = 0; i < m; i++)
            {
                for(int j = 0; j < n; j++)
                {
                    if(i==0 || j==0)
                    {
                        DP[i,j]=1;
                    }
                    else
                    {
                        DP[i,j] = DP[i,j-1] + DP[i-1,j];
                    }
                }
            }
            
            return DP[m-1, n-1];
        }
    }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.