题解 | #最长无重复子数组#
最长无重复子数组
http://www.nowcoder.com/practice/b56799ebfd684fb394bd315e89324fb4
int maxLength(int* arr, int arrLen ) {
// write code here
int i=0,j=0,k=0;
int count=0;
for(j=0;j<arrLen;j++)
{
for(k=i;k<j;k++){
if(arr[k]==arr[j])
{
i=k+1;
break;
}
}
if(j-i+1>count){
count=j-i+1;
}
}
return count;
}
// write code here
int i=0,j=0,k=0;
int count=0;
for(j=0;j<arrLen;j++)
{
for(k=i;k<j;k++){
if(arr[k]==arr[j])
{
i=k+1;
break;
}
}
if(j-i+1>count){
count=j-i+1;
}
}
return count;
}