leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

1829.cpp (356B)

0 class Solution { 1 public: 2 vector<int> getMaximumXor(vector<int> &nums, int maximumBit) { 3 const int n = nums.size(), mask = (1 << maximumBit) - 1; 4 vector<int> res(n); 5 for (int i = 0, acc = 0; i < n; i++) { 6 nums[i] = acc ^= nums[i]; 7 res[n - i - 1] = nums[i] ^ mask; 8 } 9 return res; 10 } 11 };