[第二轮] 3/18-3/24 CareerCup 5.1

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.
EXAMPLE
Input: N = 10000000000, M = 10011, i = 2, j = 6
Output: N = 10001001100

发帖规范:
http://www.1point3acres.com/bbs/thread-48094-1-1.html
http://www.1point3acres.com/bbs/thread-32423-1-1.html

easy one...

method:
*    1,  basic bit operation,one bit by one bit....
*    2 , the standard solution is better than me....
*            a, clear the bits from i to j in N
*            b, shift M so that it lines up with bits from i to j
*            c, merge the two num......
https://github.com/1094401996/Ca ... ot1/InsertBits.java

位操作很容易犯off one的错误。。。。。

跟楼上思路基本一样，顺便用了个datalab里面的bitMask函数
https://gist.github.com/myisabella/5225785#file-problem_51-java

https://gist.github.com/ThunderXu/426b45f7736287fe2aab
Set by bit, 规格严格理性帝's second method is much better

bit mask, same thoughts as method on book
https://gist.github.com/chrislukkk/5233720

/**
* part1: convert "10000000000" into "10000xxxxxx", x is '0' produced by bit move
* part2: convert "10011" into "10011xx"
* part3: convert "10000000000" into "xxxxxxxxx00"
* answer is part1|part2|part3
* We use "Or" in this algorithm instead of "And" Why?
* Compared to convert "10011" into "0000000000000000000000000 10011 00" then use "Or" operation,
* it is inconvenient to convert "10011" into "111111111111111111111111111111 10011 11" then use "And" operation,
*
*/
https://gist.github.com/Jnight/5234702 求点评，有加分

https://gist.github.com/5253713.git
same as the standard solution

这道题能否这样做：比如N=1000 0000, M=10011, i=2, j=6
step1:产生一个长为M的一串1
step2:将这一串1移到第i位，并和N进行位或操作，存为newN
step3:把M移到第i位，与newN进行位与，输出结果
这是我自己想的，请各路大神版主提出宝贵意见，不胜感激啊！！