-
Notifications
You must be signed in to change notification settings - Fork 0
/
LIP.js
85 lines (73 loc) · 2.09 KB
/
LIP.js
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
82
83
84
85
const LIP = (array) => {
const lip = Array(array.length).fill(1);
for (let i = 1; i < array.length; i++) {
for (let j = 0; j < i; j++) {
if (array[i] > array[j] && lip[i] < lip[j] + 1) {
lip[i] = lip[j] + 1;
}
}
}
return Math.max(...lip);
};
const LIPDifference = (array, difference) => {
const lip = Array(array.length).fill(1);
for (let i = 1; i < array.length; i++) {
for (let j = 0; j < i; j++) {
if (array[i] - array[j] === difference && lip[i] < lip[j] + 1) {
lip[i] = lip[j] + 1;
}
}
}
return Math.max(...lip);
};
// LIPDifference3([1,5,7,8,5,3,4,2,1], -2)
// BEST SOLUTION
function longestSubsequence(arr, difference) {
const LSMap = new Map();
let maxLen = 1;
for (let number of arr) {
const diff = number - difference;
if (!LSMap.has(diff)) {
LSMap.set(number, 1);
} else if (LSMap.has(diff)) {
LSMap.set(number, 1 + LSMap.get(diff));
}
maxLen = Math.max(maxLen, LSMap.get(number));
}
return maxLen;
}
const LIPDifference3 = (array, difference) => {
const lip = Array(array.length).fill(1);
const hm = {};
const diffs = {};
for (let i = 1; i < array.length; i++) {
diffs[array[i] - difference] = i;
}
debugger;
for (let i = 1; i < array.length; i++) {
// Math.abs()
if (array[i] - array[i - 1] === difference) {
lip[i] = 1 + lip[i - 1];
} else if (hm[array[i] + difference]) {
lip[i] = 1 + hm[array[i] + difference];
}
hm[array[i]] = lip[i];
}
return Math.max(...lip);
};
const LIPDifference2 = (array, difference) => {
const sorted = [...new Set(array)].sort(); // cols
const dp = [];
for (let i = 0; i < array.length + 1; i++) {
dp.push(Array(sorted.length + 1).fill(-1));
}
for (let i = 0; i < array.length + 1; i++) {
for (let j = 0; j < sorted.length + 1; j++) {
if (i == 0 || j == 0) dp[i][j] = 0;
else if (array[i - 1] == sorted[j - 1]) dp[i][j] = 1 + dp[i - 1][j - 1];
else dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
}
}
return dp[array.length][sorted.length];
// return Math.max(...lip);
};