深度優先搜索算法
/**
* @param {number[]} A
* @param {number[]} B
* @return {number}
*/
var findLength = function(A, B) {
const al = A.length;
const bl = B.length;
const dp = new Array(al + 1).fill(0);
for (let i = 0; i <= al; i++) {
dp[i] = new Array(bl + 1).fill(0);
}
let maxSameLen = 0;
for (let i = 1; i <= al; i++) {
for (let j = 1; j <= bl; j++) {
if (A[i - 1] == B[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
}
maxSameLen = Math.max(maxSameLen, dp[i][j]);
}
}
return maxSameLen;
};
感謝觀看 期待關注
關注我,帶你一起寫bug
warning :未經授權,不得轉載
有問題的小夥伴請在下方留言,喜歡就點個贊吧