Package g3601_3700.s3674_minimum_operations_to_equalize_array

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3674 - Minimum Operations to Equalize Array.

    Easy

    You are given an integer array nums of length n.

    In one operation, choose any subarray nums[l...r] (0 <= l <= r < n) and replace each element in that subarray with the bitwise AND of all elements.

    Return the minimum number of operations required to make all elements of nums equal.

    A subarray is a contiguous non-empty sequence of elements within an array.

    Example 1:

    Input: nums = 1,2

    Output: 1

    Explanation:

    Choose nums[0...1]: (1 AND 2) = 0, so the array becomes [0, 0] and all elements are equal in 1 operation.

    Example 2:

    Input: nums = 5,5,5

    Output: 0

    Explanation:

    nums is [5, 5, 5] which already has all elements equal, so 0 operations are required.

    Constraints:

    • 1 <= n == nums.length <= 100

    • <code>1 <= numsi<= 10<sup>5</sup></code>

    • 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 minOperations(IntArray nums)

      • Methods inherited from class java.lang.Object

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