g2301_2400.s2317_maximum_xor_after_operations.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation
Show all versions of leetcode-in-java21 Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g2301_2400.s2317_maximum_xor_after_operations;
// #Medium #Array #Math #Bit_Manipulation #2022_06_26_Time_1_ms_(100.00%)_Space_53.3_MB_(100.00%)
public class Solution {
public int maximumXOR(int[] nums) {
int max = 0;
for (int n : nums) {
max |= n;
}
return max;
}
}