Package g3201_3300.s3287_find_the_maximum_sequence_value_of_array

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3287 - Find the Maximum Sequence Value of Array.

    Hard

    You are given an integer array nums and a positive integer k.

    The value of a sequence seq of size 2 * x is defined as:

    • (seq[0] OR seq[1] OR ... OR seq[x - 1]) XOR (seq[x] OR seq[x + 1] OR ... OR seq[2 * x - 1]).

    Return the maximum value of any subsequence of nums having size 2 * k.

    Example 1:

    Input: nums = 2,6,7, k = 1

    Output: 5

    Explanation:

    The subsequence [2, 7] has the maximum value of 2 XOR 7 = 5.

    Example 2:

    Input: nums = 4,2,5,6,7, k = 2

    Output: 2

    Explanation:

    The subsequence [4, 5, 6, 7] has the maximum value of (4 OR 5) XOR (6 OR 7) = 2.

    Constraints:

    • 2 <= nums.length <= 400

    • <code>1 <= numsi< 2<sup>7</sup></code>

    • 1 &lt;= k &lt;= nums.length / 2

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxValue(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

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