3998. Minimum Operations To Equalize Array¶

3998. 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:

Example 2:

Constraints:

• 1 <= n == nums.length <= 100
• 1 <= nums[i] <= 105

Solution¶

class Solution {
    public int minOperations(int[] nums) {
        int n = nums.length;
        for (int i = 0; i < n; i++) {
            if (nums[i] != nums[0]) return 1;
        }
        return 0;
    }
}

Complexity Analysis¶

• Time Complexity: O(?)
• Space Complexity: O(?)

Explanation¶

[Add detailed explanation here]