-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGet the Maximum Score.V1.js
More file actions
81 lines (76 loc) · 2.41 KB
/
Get the Maximum Score.V1.js
File metadata and controls
81 lines (76 loc) · 2.41 KB
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
// https://leetcode-cn.com/problems/get-the-maximum-score/
var Test = require('./Common/Test');
var maxSum = function (nums1, nums2) {
const mod = 1e9 + 7;
// const mod = 1e14;
const [m, n] = [nums1.length, nums2.length];
const dp1 = Array(m + 1).fill();
const dp2 = Array(n + 1).fill();
dp1[0] = 0;
dp2[0] = 0;
let i = 0, j = 0;
while (i < m && j < n) {
const num1 = nums1[i];
const num2 = nums2[j];
if (num1 == num2) {
// dp1[i + 1] = dp2[j + 1] = Math.max(dp1[i++] + num1, dp2[j++] + num2) % mod;
const max = Math.max(dp1[i++] + num1, dp2[j++] + num2);
if (max >= mod) {
console.log({ i, j });
console.log({ max, mod: max % mod });
}
dp1[i] = dp2[j] = max % mod;
// dp1[i + 1] = dp2[j + 1] = Math.max((dp1[i++] + num1) % mod, (dp2[j++] + num2) % mod);
}
else {
if (num1 < num2) {
// dp1[i + 1] = (dp1[i++] + num1) % mod;
dp1[i + 1] = dp1[i] + nums1[i++];
if (dp1[i] >= mod) {
console.log({ i });
console.log(dp1[i]);
}
dp1[i] %= mod;
}
else {
// dp2[j + 1] = (dp2[j++] + num2) % mod;
dp2[j + 1] = dp2[j] + nums2[j++];
if (dp2[j] >= mod) {
console.log({ j });
console.log(dp2[j]);
}
dp2[j] %= mod;
}
}
}
while (i < m) {
// dp1[i + 1] = (dp1[i] + nums1[i++]) % mod;
dp1[i + 1] = dp1[i] + nums1[i++];
if (dp1[i] >= mod) {
console.log({ i });
console.log(dp1[i]);
}
dp1[i] %= mod;
}
while (j < n) {
// dp2[j + 1] = (dp2[j] + nums2[j++]) % mod;
dp2[j + 1] = dp2[j] + nums2[j++];
if (dp2[j] >= mod) {
console.log({ j });
console.log(dp2[j]);
}
// dp2[j] %= mod;
}
return Math.max(dp1[m], dp2[n]);
};
function run(nums1, nums2) {
Test.run(maxSum, nums1, nums2);
}
function testWithTestcase(id) {
Test.testWithTestcase(maxSum, id);
}
// run([2, 4, 5, 8, 10], [4, 6, 8, 9])
// run([1, 3, 5, 7, 9], [3, 5, 100])
// run([1, 2, 3, 4, 5], [6, 7, 8, 9, 10])
// run([1, 4, 5, 8, 9, 11, 19], [2, 3, 4, 11, 12])
testWithTestcase(104807690);