20 lines
369 B
Go
20 lines
369 B
Go
// Package q3314 implements a solution for https://leetcode.com/problems/construct-the-minimum-bitwise-array-i/
|
|
package q3314
|
|
|
|
func minBitwiseArray(nums []int) []int {
|
|
for i := range nums {
|
|
if nums[i]%2 == 0 {
|
|
nums[i] = -1
|
|
continue
|
|
}
|
|
|
|
p := 1
|
|
for nums[i]|(1<<p) == nums[i] {
|
|
p++
|
|
}
|
|
nums[i] -= 1 << (p - 1)
|
|
}
|
|
return nums
|
|
}
|
|
|
|
var _ = minBitwiseArray
|