[3095] Shortest Subarray With OR at Least K I

想說來寫個sliding window , 結果這題要求用暴力解XD

sliding window是在第二集！！！

好吧那我就不客氣的暴力解了喔 QQ

中間有個可以加速的地方！

int minimumSubarrayLength(int* nums, int numsSize, int k) {

int len = INT_MAX;

int curOr = 0;

for (int i=0; i<numsSize; i++)

{

curOr = 0;

for (int j=i; j<numsSize; j++)

{

curOr |= nums[j];

if (curOr >=k)

{

if ((j-i+1) < len)

len = (j-i+1);

break;//偷加速, 反正後面長度不可能比它短了

}

}

}

if (len == INT_MAX)

return -1;

return len;

}