Skip to content

3315. Construct the Minimum Bitwise Array II 👍

  • Time: $O(\Sigma \log\texttt{nums[i]}) \approx O(n)$
  • Space: $O(n)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
class Solution {
 public:
  // Same as 3314. Construct the Minimum Bitwise Array I
  vector<int> minBitwiseArray(vector<int>& nums) {
    vector<int> ans;

    for (const int num : nums)
      ans.push_back(num == 2 ? -1 : num - getLeadingOneOfLastGroupOfOnes(num));

    return ans;
  }

 private:
  // Returns the leading one of the last group of 1s in the binary
  // representation of num. For example, if num = 0b10111, the leading one of
  // the last group of 1s is 0b100.
  int getLeadingOneOfLastGroupOfOnes(int num) {
    int leadingOne = 1;
    while ((num & leadingOne) > 0)
      leadingOne <<= 1;
    return leadingOne >> 1;
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution {
  // Same as 3314. Construct the Minimum Bitwise Array I
  public int[] minBitwiseArray(List<Integer> nums) {
    int[] ans = new int[nums.size()];

    for (int i = 0; i < nums.size(); ++i)
      ans[i] = nums.get(i) == 2 ? -1 : nums.get(i) - getLeadingOneOfLastGroupOfOnes(nums.get(i));

    return ans;
  }

  // Returns the leading one of the last group of 1s in the binary
  // representation of num. For example, if num = 0b10111, the leading one of
  // the last group of 1s is 0b100.
  private int getLeadingOneOfLastGroupOfOnes(int num) {
    int leadingOne = 1;
    while ((num & leadingOne) > 0)
      leadingOne <<= 1;
    return leadingOne >> 1;
  }
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
class Solution:
  # Same as 3314. Construct the Minimum Bitwise Array I
  def minBitwiseArray(self, nums: list[int]) -> list[int]:
    return [-1 if num == 2 else num - self._getLeadingOneOfLastGroupOfOnes(num)
            for num in nums]

  def _getLeadingOneOfLastGroupOfOnes(self, num: int) -> int:
    """
    Returns the leading one of the last group of 1s in the binary
    representation of num. For example, if num = 0b10111, the leading one of
    the last group of 1s is 0b100.
    """
    leadingOne = 1
    while (num & leadingOne) > 0:
      leadingOne <<= 1
    return leadingOne >> 1