Lite Text

public int maxSpan(int[] nums)
{
int max = 0;
for(int i=0; i<nums.length; i++)
{
boolean repeated = false;
int repeat = 0;
for(int j=i+1; j<nums.length; j++)
{
if(nums[i]==nums[j])
{
repeated = true;
repeat = j;
}
}
if(repeated&&repeat-i+1>max){max = repeat-i+1;}
else if(!repeated&&max==0){max=1;}
}
return max;
}