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 6559d02 commit a2e49f8Copy full SHA for a2e49f8
algorithm-exercises-java/src/main/java/ae/projecteuler/Problem0015.java
@@ -16,7 +16,8 @@ private Problem0015() {}
16
*/
17
public static Long problem0015(Integer gridSide) {
18
19
- Long[][] grid = new Long[gridSide + 1][gridSide + 1];
+ int limit = gridSide + 1;
20
+ Long[][] grid = new Long[limit][limit];
21
22
// initialization
23
for (int i = 0; i <= gridSide; i++) {
@@ -26,8 +27,8 @@ public static Long problem0015(Integer gridSide) {
26
27
}
28
29
// vertex computing
- for (int i = 1; i <= gridSide; i++) {
30
- for (int j = 1; j <= gridSide; j++) {
+ for (int i = 1; i < limit; i++) {
31
+ for (int j = 1; j < limit; j++) {
32
long upperParent = grid[i - 1][j];
33
long leftParent = grid[i][j - 1];
34
0 commit comments