检测相邻递增子数组

bool hasIncreasingSubarrays(int* nums, int numsSize, int k) {
int i;
for(i=0;i<=numsSize-(2*k);i++){
int tmp=i;
while(tmp<i+k-1){
if(nums[tmp]<nums[tmp+1])
tmp++;
else break;
}
if(tmpi+k-1){
int b=tmp+1;
while(b<tmp+k){
if(nums[b]<nums[b+1])
b++;
else break;
}
if(btmp+k) return true;
//else return false;
}
}
return false;
}