leetcode 718( Maximum Length of Repeated Subarray)
1.題目描述:給定兩個陣列,在兩個陣列中,返回包含相同元素最多的陣列的長度。
例子:
A: [1,2,3,2,1]
B: [3,2,1,4,7]
返回:3.
解釋:在陣列 A和B中最長的子陣列為[3,2,1]長度為3.
2.程式碼:
class Solution{
public int findLength(int [] A, int [] B){
int res = 0;
// java 中 int 預設值為0,需要前一個的值因此長度要比以前的陣列大一
int [][] dp = new int[A.length+1][B.length+1];
for (int i = 0; i < A.length; i++){
for(int j = 0; j < B.length; j++){
if(A[i] == B[j]){
dp[i+1][j+1] = dp[i][j] +1;
}
res = Math.max(res, dp[i+1][j+1]);
}
}
return res;
}
}
相關推薦
Leetcode 718 Maximum Length of Repeated Subarray
Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays. Example 1: Input: A: [1,2,3,2,1] B: [
[leetcode]718. Maximum Length of Repeated Subarray
[leetcode]718. Maximum Length of Repeated Subarray Analysis 今天被微博上的孫藝興bot笑死,哈哈哈哈哈—— [每天刷題並不難0.0] Given two integer arrays A and B,
leetcode 718. Maximum Length of Repeated Subarray 最長公共子串 + 動態規劃DP
Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays. Example 1: Input: A: [1,
leetcode 718( Maximum Length of Repeated Subarray)
1.題目描述:給定兩個陣列,在兩個陣列中,返回包含相同元素最多的陣列的長度。 例子: A: [1,2,3,2,1] B: [3,2,1,4,7] 返回:3. 解釋:在陣列 A和B中最長的子陣列為[3,2,1]長度為3. 2.程式碼: class
718. Maximum Length of Repeated Subarray 字尾陣列解最長公共子串 O(n log^2 n)時間複雜度
題意 找最長公共子串 思路 用dp的方法很容易在O(n^2)解決問題,這裡主要討論用字尾陣列的思路解決這個問題 字尾數組裡有兩個經典的概念或者稱為資料結構,就是字尾陣列SA,以及高度陣列LCP SA陣列的定義是:將原串S所有的字尾按字典序排序
718. Maximum Length of Repeated Subarray(python+cpp)
題目: Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays. Example 1: Input: A: [1,2,3
LC 718. Maximum Length of Repeated Subarray
Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays. Example 1: Input: A: [1,2,
[LeetCode] Maximum Length of Repeated Subarray 最長的重複子陣列
Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays. Example 1: Input: A: [1,2,3,2,1] B: [3,2,1,
Maximum Length of Repeated Subarray 最長重複子陣列
給兩個整數陣列 A 和 B ,返回兩個陣列中公共的、長度最長的子陣列的長度。示例 1:輸入: A: [1,2,3,2,1] B: [3,2,1,4,7] 輸出: 3 解釋: 長度最長的公共子陣列是 [3, 2, 1]。 說明:1 <= len(A), len(B) &
LeetCode 646. Maximum Length of Pair Chain
You are given n pairs of numbers. In every pair, the first number is always smaller than the second number. Now, we define a pair (c, d) can follow anothe
LeetCode 646. Maximum Length of Pair Chain [Medium]
原題地址 題目內容 題目分析 題目的意思為找出能相連的最長串的長度,(a,b),(c,d),因為b < c,所以他們是能相連的。採用動態規劃的方法,首先對原來的pair陣列進行排序。用dp[n]記錄每個pair能形成鏈的最大長度。設一個變數temp,如果【pairs[
Leetcode 646. Maximum Length of Pair Chain 找最長鏈 解題報告
這道題麼,找最長的鏈,所謂的鏈就是上一個的結尾一定大於下一個的開頭 因為要找最長的鏈,所以我們按照結尾的那個數字排序,這樣可以儘量的最長 然後從第一個開始,直接往後遍歷找就好,反正在前面的一定是一個
[LeetCode] 628. Maximum Product of Three Numbers 三個數字的最大乘積 [LeetCode] 152. Maximum Product Subarray 求最大子陣列乘積 All LeetCode Questions List 題目彙總
Given an integer array, find three numbers whose product is maximum and output the maximum product. Example 1: Input: [1,2,3] Output: 6 Example 2
[LeetCode] Maximum Length of Pair Chain 鏈對的最大長度
You are given n pairs of numbers. In every pair, the first number is always smaller than the second number. Now, we define a pair (c, d) can follow anot
[LeetCode] 104. Maximum Depth of Binary Tree Java
font from max clas [] 高度 java ret 使用 題目: Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the
646. Maximum Length of Pair Chain
and stat cor eve lan href htm prev follow Problem statement You are given n pairs of numbers. In every pair, the first number is alway
[Leetcode]628. Maximum Product of Three Numbers
hose maximum cnblogs rip max etc 就是 find not Given an integer array, find three numbers whose product is maximum and output the maxim
646. Maximum Length of Pair Chain 對鏈最大長度
fin eve select solution www elf stc amp ati You are given n pairs of numbers. In every pair, the first number is always smaller than the
[LeetCode]662. Maximum Width of Binary Tree判斷樹的寬度
數據 left 層序遍歷 pty 添加 當前 body maximum emp public int widthOfBinaryTree(TreeNode root) { /* 層序遍歷+記錄完全二叉樹的坐標,左孩子2*i,右孩子2*i+1
leetcode-628-Maximum Product of Three Numbers
ssi arr spa tip iss beat nth col 就是 題目描述: Given an integer array, find three numbers whose product is maximum and output the maximum prod