Skip to content

Commit d446e8a

Browse files
Add pseudo-code
1 parent 047185c commit d446e8a

2 files changed

Lines changed: 49 additions & 0 deletions

File tree

Pseudocode/DP/1d-range-sum.txt

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
nums = [1, 2, 3...]
2+
sum = 0
3+
max = -inf
4+
5+
for (num : nums) {
6+
sum += num
7+
max = max(max, sum)
8+
if (sum < 0) {
9+
sum = 0
10+
}
11+
}
12+
13+
max

Pseudocode/DP/2d-range-sum.txt

Lines changed: 36 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,36 @@
1+
M[R, C]
2+
3+
for (i = 0; i < R; ++i) {
4+
for (j = 0; j < C; ++j) {
5+
if (i > 0) {
6+
M[i, j] += M[i - 1, j]
7+
}
8+
if (j > 0) {
9+
M[i, j] += M[i, j - 1]
10+
}
11+
if (i > 0 and j > 0) {
12+
M[i, j] -= M[i - 1, j - 1]
13+
}
14+
}
15+
}
16+
17+
max = -inf
18+
for (i = 0; i < n; ++i) {
19+
for (j = 0; j < n; ++j) {
20+
for (k = i; k < n; ++k) {
21+
for (l = j; l < n; ++l) {
22+
sum = M[k][l]
23+
if (i > 0) {
24+
sum -= M[i - 1][l]
25+
}
26+
if (j > 0) {
27+
sum -= M[k][j - 1]
28+
}
29+
if (i > 0 and j > 0) {
30+
sum += M[i - 1][j - 1]
31+
}
32+
max = max(max, sum)
33+
}
34+
}
35+
}
36+
}

0 commit comments

Comments
 (0)