We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 4a3599f commit ddbed0aCopy full SHA for ddbed0a
C++/number-of-increasing-paths-in-a-grid.cpp
@@ -13,7 +13,7 @@ class Solution {
13
for (int i = 0; i < size(grid); ++i) {
14
for (int j = 0; j < size(grid[0]); ++j) {
15
for (const auto& [di, dj] : directions) {
16
- int ni = i + di, nj = j + dj;
+ const int ni = i + di, nj = j + dj;
17
if (0 <= ni && ni < size(grid) &&
18
0 <= nj && nj < size(grid[0]) &&
19
grid[i][j] > grid[ni][nj]) {
@@ -32,7 +32,7 @@ class Solution {
32
for (const auto& [i, j] : q) {
33
result = (result + dp[i][j]) % MOD;
34
35
36
if (!(0 <= ni && ni < size(grid) &&
37
38
grid[i][j] < grid[ni][nj])) {
0 commit comments