You are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to set all bits between i and j in N equal to M (e.g., M becomes a substring of N located at i and starting at j).
EXAMPLE:
Input: N = 10000000000, M = 10101, i = 2, j = 6
Output: N = 10001010100
left: j(不包含j)的左侧全置1,其余为0
right: i(不包含i)的右侧全置1,其余为0
mask:left|right,相当于M中,(i, j)外侧全部为1,其余为0
#include<iostream>
#include<bitset>
using namespace std;
//M becomes a substring of N located at i and starting at j
int main(){
string s="1111111111111";
string t="01000";
bitset<32> n(s);
bitset<32> m(t);
int max= ~0;
int i=2, j=6;
bitset<32> left = max - ((1 << (j+1)) - 1);
//cout<<left<<endl;
bitset<32> right = (1 << i) - 1;
//cout<<right<<endl;
bitset<32> mask = left | right;
//cout<<mask<<endl;
//cout<<(n & mask)<<endl;
//cout<<(m << i)<<endl;
//cout<<((n & mask) |(m << i));
return 0;
}