(s, t, tabu)
| 90 | }; |
| 91 | |
| 92 | var search = (s, t, tabu) => { |
| 93 | for (let r = s.length - 1; 0 <= r; r--) { |
| 94 | /* Time O(N) */ |
| 95 | for (let c = t.length - 1; 0 <= c; c--) { |
| 96 | /* Time O(M) */ |
| 97 | const left = tabu[r + 1][c]; |
| 98 | |
| 99 | const isEqual = s[r] === t[c]; |
| 100 | |
| 101 | const right = isEqual ? tabu[r + 1][c + 1] : 0; |
| 102 | |
| 103 | tabu[r][c] = left + right; /* Space O(N * M) */ |
| 104 | } |
| 105 | } |
| 106 | }; |
| 107 | |
| 108 | /** |
| 109 | * DP - Bottom Up |