C++ solution simple and clear approach faster then 90.5%

using prefix and suffix methd;
'''
class Solution {
public:
int findLength(vector& nums1, vector& nums2) {
int m=nums1.size();
int n=nums2.size();
int a[m+1][n+1];
for(int i=0;i<=m;i++)
a[i][0]=0;
for(int i=0;i<=n;i++)
a[0][i]=0;
int len=0;
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
if(nums1[i-1]==nums2[j-1])
{
a[i][j]=a[i-1][j-1]+1;
if(a[i][j]>len)
len=a[i][j];
}
else
a[i][j]=0;
}
}
return len;
}
};'''

Comments (0)