leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0718.cpp (508B)

0 class Solution { 1 public: 2 int findLength(const vector<int> &nums1, const vector<int> &nums2) const { 3 static int dp[1002][1002]; 4 int res = 0; 5 6 memset(dp, 0x00, sizeof(dp)); 7 for (int i = size(nums1) - 1; i >= 0; i--) { 8 for (int j = size(nums2) - 1; j >= 0; j--) { 9 if (nums1[i] != nums2[j]) continue; 10 dp[i][j] = dp[i + 1][j + 1] + 1; 11 res = max(res, dp[i][j]); 12 } 13 } 14 15 return res; 16 } 17 };