Skip to content

Commit 4ebc8d4

Browse files
authored
Update number-of-increasing-paths-in-a-grid.py
1 parent fdf81a0 commit 4ebc8d4

File tree

1 file changed

+5
-5
lines changed

1 file changed

+5
-5
lines changed

Python/number-of-increasing-paths-in-a-grid.py

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -10,15 +10,15 @@ def countPaths(self, grid):
1010
"""
1111
MOD = 10**9+7
1212
directions = [(0, 1), (1, 0), (0, -1), (-1, 0)]
13-
degree = [[0]*len(grid[0]) for _ in xrange(len(grid))]
13+
in_degree = [[0]*len(grid[0]) for _ in xrange(len(grid))]
1414
q = []
1515
for i in xrange(len(grid)):
1616
for j in xrange(len(grid[0])):
1717
for di, dj in directions:
1818
ni, nj = i+di, j+dj
1919
if 0 <= ni < len(grid) and 0 <= nj < len(grid[0]) and grid[i][j] > grid[ni][nj]:
20-
degree[i][j] += 1
21-
if not degree[i][j]:
20+
in_degree[i][j] += 1
21+
if not in_degree[i][j]:
2222
q.append((i, j))
2323
dp = [[1]*len(grid[0]) for _ in xrange(len(grid))]
2424
result = 0
@@ -31,8 +31,8 @@ def countPaths(self, grid):
3131
if not (0 <= ni < len(grid) and 0 <= nj < len(grid[0]) and grid[i][j] < grid[ni][nj]):
3232
continue
3333
dp[ni][nj] = (dp[ni][nj]+dp[i][j])%MOD
34-
degree[ni][nj] -= 1
35-
if not degree[ni][nj]:
34+
in_degree[ni][nj] -= 1
35+
if not in_degree[ni][nj]:
3636
new_q.append((ni, nj))
3737
q = new_q
3838
return result

0 commit comments

Comments
 (0)