Notice
250x250
Recent Posts
Recent Comments
Link
목록비트 조작 (1)
넘치게 채우기

https://leetcode.com/problems/minimum-number-of-operations-to-make-array-xor-equal-to-k/description/leetcode - Minimum Number of Operations to Make Array XOR Equal to K문제 유형 : 비트마스킹, 비트 조작문제 난이도 : Medium 문제You are given a 0-indexed integer array nums and a positive integer k.You can apply the following operation on the array any number of times:Choose any element of the array and flip a bit in i..
PS/LeetCode
2024. 4. 29. 15:00