aboutsummaryrefslogtreecommitdiff
path: root/other/max_length_repeated_subarr.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'other/max_length_repeated_subarr.cpp')
-rw-r--r--other/max_length_repeated_subarr.cpp26
1 files changed, 0 insertions, 26 deletions
diff --git a/other/max_length_repeated_subarr.cpp b/other/max_length_repeated_subarr.cpp
deleted file mode 100644
index 6e8ef68..0000000
--- a/other/max_length_repeated_subarr.cpp
+++ /dev/null
@@ -1,26 +0,0 @@
-#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);
-}