C# implementaion


  • 0
    C

    Here is my C# implementation. Standard DP solution, just need to reset when meet 1

        public int UniquePathsWithObstacles(int[,] obstacleGrid)
        {
            int rows = obstacleGrid.GetLength(0);
            int cols = obstacleGrid.GetLength(1);
            int[] dp = new int[cols];
            dp[0] = 1;
    
            for (int i = 0; i < rows; i++)
            {
                for (int j = 0; j < cols; j++)
                {
                    if (obstacleGrid[i, j] == 1)
                    {
                        dp[j] = 0;
                    }
                    else if (j > 0)
                    {
                        dp[j] += dp[j - 1];
                    }
                }
            }
    
            return dp[cols - 1];
        }

Log in to reply
 

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