Solution of Insert Into Bits LCCI

You are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to insert M into N such that M starts at bit j and ends at bit i. You can assume that the bits j through i have enough space to fit all of M. That is, if M = 10011, you can assume that there are at least 5 bits between j and i. You would not, for example, have j = 3 and i = 2, because M could not fully fit between bit 3 and bit 2.

Example1:

Input: N = 10000000000, M = 10011, i = 2, j = 6
Output: N = 10001001100

Example2:

Input: N = 0, M = 11111, i = 0, j = 4
Output: N = 11111

Ideas of solving a problem

They want to insert M into N so that M starts at the j th bit of N and ends at the i th bit.And they tell us that there can’t be a situation where M doesn’t fit between j and I.So we can do a bit operation, and we can directly compute the value of N after insertion. The time complexity is O(1), and the space complexity is O(1). The memory consumption is 1.9Mb.

Code

package main

import (
	"fmt"
)
func main(){
	fmt.Println(insertBits(0,11111,0,4))
}
func insertBits(N int, M int, i int, j int) int {
	return ((N >> (j + 1)) << (j + 1)) | ((N >> i << i) ^ N)|( M<<i)
}

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/insert-into-bits-lcci