Package g2501_2600.s2568_minimum_impossible_or

Class Solution

java.lang.Object

g2501_2600.s2568_minimum_impossible_or.Solution

public class Solution
extends Object

2568 - Minimum Impossible OR.<p>Medium</p> <p>You are given a <strong>0-indexed</strong> integer array <code>nums</code>.</p> <p>We say that an integer x is <strong>expressible</strong> from <code>nums</code> if there exist some integers <code>0 <= index₁ < index₂ < &hellip; < index_k < nums.length</code> for which <code>nums[index₁] | nums[index₂] | &hellip; | nums[index_k] = x</code>. In other words, an integer is expressible if it can be written as the bitwise OR of some subsequence of <code>nums</code>.</p> <p>Return <em>the minimum <strong>positive non-zero integer</strong> that is not</em> <em>expressible from</em> <code>nums</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [2,1]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong> 1 and 2 are already present in the array. We know that 3 is expressible, since nums[0] | nums[1] = 2 | 1 = 3. Since 4 is not expressible, we return 4.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [5,3,2]</p> <p><strong>Output:</strong> 1</p> <p><strong>Explanation:</strong> We can show that 1 is the smallest number that is not expressible.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁵</code></li> <li><code>1 <= nums[i] <= 10⁹</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	minImpossibleOR(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

minImpossibleOR

public int minImpossibleOR(int[] nums)