名題精選百則_題1.1
[INPUT]
number set which is sorted in increment order
ex. 1,2,2,3,3,3,4,5,5,6
[OUTPUT]
find the longest plateau
ex. 3,3,3
[THINK]
[SCv1]
[SCv2]
ex. 1,2,2,3,3,3,4,5,5,6
[OUTPUT]
find the longest plateau
ex. 3,3,3
[THINK]
[SCv1]
//arr is sorted array
//maxL is result length
//maxN is result element
int i=0,tmpL=0,tmpN=0;
int maxL=0,maxN=0;
for(i=0;i<10;i++){
if(i==0){
tmpL=1;
tmpN=arr[i];
}
else{
if(arr[i]==arr[i-1]){
tmpL++;
}
else{
if(tmpL>maxL){
maxL=tmpL;
maxN=arr[i-1];
tmpL=1;
}
else{
tmpL=1;
tmpN=arr[i];
}
}
}
}
[SCv2]
沒有留言:
張貼留言