19 lines
359 B
Go
19 lines
359 B
Go
// Package q3315 implements a solution for https://leetcode.com/problems/construct-the-minimum-bitwise-array-ii/
|
|
package q3315
|
|
|
|
func minBitwiseArray(nums []int) []int {
|
|
for i, num := range nums {
|
|
if num == 2 {
|
|
nums[i] = -1
|
|
continue
|
|
}
|
|
|
|
t := 1
|
|
for ; num|(t<<1) == num; t <<= 1 {
|
|
}
|
|
nums[i] = num - t
|
|
}
|
|
return nums
|
|
}
|
|
|
|
var _ = minBitwiseArray
|