-
Notifications
You must be signed in to change notification settings - Fork 0
/
0712-minimum-ascii-delete-sum-for-two-strings.cpp
50 lines (41 loc) · 1.49 KB
/
0712-minimum-ascii-delete-sum-for-two-strings.cpp
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
39
40
41
42
43
44
45
46
47
48
49
50
class Solution {
public:
// Placebo
int minimumDeleteSum(string s1, string s2) {
// Make sure s2 is smaller string
if (s1.length() < s2.length()) {
return minimumDeleteSum(s2, s1);
}
// Case for empty s1
int m = s1.length(), n = s2.length();
vector<int> currRow(n + 1);
for (int j = 1; j <= n; j++) {
currRow[j] = currRow[j - 1] + s2[j - 1];
}
// Compute answer row-by-row
for (int i = 1; i <= m; i++) {
int diag = currRow[0];
currRow[0] += s1[i - 1];
for (int j = 1; j <= n; j++) {
int answer;
// If characters are the same, the answer is top-left-diagonal value
if (s1[i - 1] == s2[j - 1]) {
answer = diag;
}
// Otherwise, the answer is minimum of top and left values with
// deleted character's ASCII value
else {
answer = min(
s1[i - 1] + currRow[j],
s2[j - 1] + currRow[j - 1]
);
}
// Before overwriting currRow[j] with answer, save it in diag
// for the next column
diag = currRow[j];
currRow[j] = answer;
}
}
return currRow[n];
}
};