但好吧其實我也沒辦法推出這麼一步到位的結論QQ
傷心啊XD
#define max(A,B) (A>B)?(A):(B)
int longestNiceSubarray(int* nums, int numsSize) {
int ret = 1;
int l=0, r=1;
if (numsSize <=1 )
return ret;
int curr=nums[0];
while (r<numsSize)
{
while ((curr & nums[r]) != 0) //<<<這行的括號!!!!!
curr ^= nums[l++];
ret = max(ret, r-l+1);
curr |= nums[r++];
}
return ret;
}
沒有留言:
張貼留言