leetcode

0 class Solution {

1 public:

2 int longestNiceSubarray(const vector<int> &nums) const {

3 int res = 0, used = 0, j = 0;

4

5 for (int i = 0; i < size(nums); i++) {

6 while (used & nums[i])

7 used ^= nums[j++];

8 used |= nums[i];

9 res = max(res, i - j);

10 }

11

12 return res + 1;

13 }

14 };