问题描述：maxSpan问题
| Consider the leftmost and righmost appearances of some value in an array. We'll say that the "span" is the number of elements between the two inclusive. A single value has a span of 1. Returns the largest span found in the given array. (Efficiency is not a priority.) maxSpan([1, 2, 1, 1, 3]) → 4 maxSpan([1, 4, 2, 1, 4, 1, 4]) → 6 maxSpan([1, 4, 2, 1, 4, 4, 4]) → 6 |
代码：
public int maxSpan(int[] nums) {
int N = nums.length;
if(N==0) return 0;
int ans=0,span=0; //ans记录当前最长span,span记录每个元素的span
for(int i=0;i<N;i++) {
int j=N-1;
while(j>=i) {
if(nums[j]==nums[i]) break;
else j--;
}
span=j-i+1;
if(span>ans) ans=span; //更新ans
}
return ans;
}