Computer_Science/leetcode/63-unique_paths_II.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

#include <stdio.h>

int uniquePathsWithObstacles(int** obstacleGrid, int obstacleGridRowSize, int obstacleGridColSize) {
	int i, j;
	int matrix[obstacleGridRowSize][obstacleGridColSize];

	for(i = 0; i < obstacleGridColSize; i++) {
		if(obstacleGrid[0][i] == 0)
			matrix[0][i] = 1;
		else
			for(; i < obstacleGridColSize; i++)
				matrix[0][i] = 0;
	}

	for(i = 0; i < obstacleGridRowSize; i++) {
		if(obstacleGrid[i][0] == 0)
			matrix[i][0] = 1;
		else
			for(; i < obstacleGridRowSize; i++)
				matrix[i][0] = 0;
	}

	for(i = 1; i < obstacleGridRowSize; i++) {
		for(j = 1; j < obstacleGridColSize; j++) {
			if(obstacleGrid[i][j] == 1)
				matrix[i][j] = 0;
			else
				matrix[i][j] = matrix[i - 1][j] + matrix[i][j - 1];
		}
	}
	
	return matrix[obstacleGridRowSize - 1][obstacleGridColSize - 1];
}

int main()
{
	return 0;
}