aboutsummaryrefslogtreecommitdiff
path: root/max_length_repeated_subarr.cpp
diff options
context:
space:
mode:
authorjack <[email protected]>2024-06-14 13:13:15 -0600
committerjack <[email protected]>2024-06-14 13:13:15 -0600
commitd343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa (patch)
tree96df922dae2a5073d9a50ea70c7aae6aa37e3ebe /max_length_repeated_subarr.cpp
downloadleetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.tar.gz
leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.zip
initial
Diffstat (limited to 'max_length_repeated_subarr.cpp')
-rw-r--r--max_length_repeated_subarr.cpp26
1 files changed, 26 insertions, 0 deletions
diff --git a/max_length_repeated_subarr.cpp b/max_length_repeated_subarr.cpp
new file mode 100644
index 0000000..59ab0bd
--- /dev/null
+++ b/max_length_repeated_subarr.cpp
@@ -0,0 +1,26 @@
+#include "leetcode.h"
+
+class Solution {
+public:
+ int findLength(vector<int> &nums1, vector<int> &nums2) {
+ int m = nums1.size(), n = nums2.size();
+ vvd(int) dp(m + 1, vector<int>(n + 1));
+ int ans = 0;
+ for (int i = 1; i <= m; ++i) {
+ for (int j = 1; j <= n; ++j) {
+ if (nums1[i - 1] == nums2[j - 1])
+ dp[i][j] = dp[i - 1][j - 1] + 1;
+ else
+ dp[i][j] = 0;
+ ans = max(ans, dp[i][j]);
+ }
+ }
+ return ans;
+ }
+};
+
+int main() {
+ Solution obj;
+ vector<int> nums1 = {1, 2, 3, 2, 1}, nums2 = {3, 2, 1, 4, 7};
+ cout << obj.findLength(nums1, nums2);
+}