【leetcode】476. Number Complement
来源:互联网 发布:软件外包协会 编辑:程序博客网 时间:2024/06/14 04:56
给一个正数,比如5(101)然后取反得(010),返回2
思路:算出来这个数前面有多少个0,然后左移,再取反,再右移回去即可。这个出现符号位变1的问题,与上0x7fffffff即可
int solution::findComplement(int num) {int numBackup = num;int zeroCount = 0; // 符号位while ((num & 0x40000000) == 0){zeroCount++;num = num << 1;}numBackup = ~num;numBackup = numBackup & 0x7fffffff;numBackup = numBackup >> (zeroCount);return numBackup;}
阅读全文
0 0
- LeetCode 476. Number Complement
- leetcode 476. Number Complement
- 【Leetcode】476. Number Complement
- 【Leetcode】476. Number Complement
- LeetCode 476. Number Complement
- LeetCode 476. Number Complement
- LeetCode--476. Number Complement
- LeetCode 476. Number Complement
- 476. Number Complement [LeetCode]
- [LeetCode]476.Number Complement
- 【LeetCode】 476. Number Complement
- LeetCode 476. Number Complement
- LeetCode 476. Number Complement
- 【LeetCode】476. Number Complement
- leetcode 476. Number Complement
- [LeetCode]476. Number Complement
- LeetCode 476. Number Complement
- 【LeetCode】476. Number Complement
- 页面table导出Excel——table2excel
- 文件存储
- adversarial evaluation of Dialogue models- 类似gan的思路来做对话评测
- 框架篇:Spring+SpringMVC+Mybatis整合开发
- 你真的喜欢技术吗?
- 【leetcode】476. Number Complement
- webstorm 配置浏览器
- javascript常见数据结构与算法
- Blockly编程:用Scratch制作游戏愤怒的小牛(小鸟)
- 实战征集令
- hibernate中Criteria的完整用法
- top k算法讲解
- 最全最好用的Android Studio插件整理
- 手机+frp内网穿透搭建随身携带的服务器