aboutsummaryrefslogtreecommitdiff
path: root/other/max_length_repeated_subarr.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
committerJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
commit7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch)
treeeb7a24ee2067f92245c57bb118e85a1baf15df50 /other/max_length_repeated_subarr.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'other/max_length_repeated_subarr.cpp')
-rw-r--r--other/max_length_repeated_subarr.cpp26
1 files changed, 26 insertions, 0 deletions
diff --git a/other/max_length_repeated_subarr.cpp b/other/max_length_repeated_subarr.cpp
new file mode 100644
index 0000000..6e8ef68
--- /dev/null
+++ b/other/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 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);
+}