Re: [閒聊] 每日leetcode

[dont (dont)]

1829. Maximum XOR for Each Query

## 思路

先對整個nums陣列做XOR
k = xor ^ mask (11111111)

for loop紀錄k並更新xor值

## Code

```python
class Solution:
    def getMaximumXor(self, nums: List[int], maximumBit: int) -> List[int]:
        n = len(nums)
        xor = 0
        for num in nums:
            xor ^= num

        res = []
        mask = (1 << maximumBit) - 1
        for i in range(n-1, -1, -1):
            res.append(xor ^ mask)
            xor ^= nums[i]

        return res
```

--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 94.156.205.29 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1731065418.A.04C.html
推 oin1104: 大師