lintcode:Update Bits
来源:互联网 发布:网络嗅探器使用教程 编辑:程序博客网 时间:2024/06/02 04:04
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 Given N=(10000000000)2, M=(10101)2, i=2, j=6
return N=(10001010100)2
Note In the function, the numbers N and M will given in decimal, you
should also return a decimal number.Challenge Minimum number of operations?
Clarification 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.
这题如果转化为二进制字符串再操作不难。
但如何用位操作来达到目标比较难。
- 如果j<31,即j不在最高位上。可以把i到j位清为0,可以
((1<<(j+1))-(1<<i))
得到i到j之间全是1的数,再取反,得到i到j之间全是0的数。 - 如果j=32,
(1<<(j+1))即(1<<32),相当于1<<1
不可行。可以直接(1<<i)-1
得到i到j之间全是0,其他地方是1的数。 - 上面得到的数成为掩码
(m<<i)+(n&mask)
可以得到最终解。
class Solution {public: /** *@param n, m: Two integer *@param i, j: Two bit positions *return: An integer */ int updateBits(int n, int m, int i, int j) { // write your code here int mask; if(j<31){ mask=~((1<<(j+1))-(1<<i)); }else{ mask=(1<<i)-1; } return (m<<i)+(n&mask); }};
- lintcode:Update Bits
- Update Bits
- lintcode: Flip Bits
- #179 Update Bits
- Lintcode179 Update Bits solution 题解
- 重装windows update服务和BITS服务
- LintCode Flip Bits 将整数A转换为B
- lintcode | 将整数A转换为B, Flip Bits
- lintcode/leetcode由易至难第17题:Counting Bits
- 179.Update Bits-更新二进制位(中等题)
- Bits
- Bits*
- LintCode
- lintcode--
- lintcode
- LintCode
- Lintcode
- update
- 将DataTable中多条记录的两列拼接显示
- 相见恨晚的函数:setUserVisibleHint()实现 fragment 对用户可见时才加载资源(延迟加载)。
- 并查集-POJ-1611-The Suspects
- LeetCode23. Merge k Sorted Lists!!!!!!
- RedWallet 微信抢红包 Wilson
- lintcode:Update Bits
- Android SDK HTTP Proxy Server
- ffmpeg入门(二)
- Python Shell 中IDLE清屏
- iOS应用架构谈
- Spring MVC 4 HelloWorld
- JavaScript第三课——数据类型(typeof操作符、Undefined类型、Null类型、Boolean类型)
- Logstash 实践之Spark Driver日志解析
- Cfree-5各种抽风解决办法