msb_14613
/
algorithm-class
26
23
Code Issues Pull Requests Projects Releases Wiki Activity

modify code

Browse Source
master
algorithmzuo 3 years ago
parent 23816fe570
commit 17515e3d99
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File

10
算法周更班/class_2022_08_4_week/Code02_ChangeToSame.java
Unescape View File

@ -94,13 +94,13 @@ public class Code02_ChangeToSame {
} }
int ans = 0; int ans = 0;
if (indexA == A.length && indexB != B.length) { if (indexA == A.length && indexB != B.length) {
ans = B[indexB] + change(A, B, indexA, indexB + 1); ans = B[indexB] + change(A, B, indexA, indexB + 1, dp);
} else if (indexA != A.length && indexB == B.length) { } else if (indexA != A.length && indexB == B.length) {
ans = A[indexA] + change(A, B, indexA + 1, indexB); ans = A[indexA] + change(A, B, indexA + 1, indexB, dp);
} else { } else {
int p1 = A[indexA] + change(A, B, indexA + 1, indexB); int p1 = A[indexA] + change(A, B, indexA + 1, indexB, dp);
int p2 = B[indexB] + change(A, B, indexA, indexB + 1); int p2 = B[indexB] + change(A, B, indexA, indexB + 1, dp);
int p45 = Math.abs(A[indexA] - B[indexB]) + change(A, B, indexA + 1, indexB + 1); int p45 = Math.abs(A[indexA] - B[indexB]) + change(A, B, indexA + 1, indexB + 1, dp);
ans = Math.min(Math.min(p1, p2), p45); ans = Math.min(Math.min(p1, p2), p45);
} }
dp[indexA][indexB] = ans; dp[indexA][indexB] = ans;

Write Preview
Loading…
Cancel
Save