leetcode 29. Divide Two Integers
来源：互联网 发布：真实的王菲 知乎 编辑：程序博客网 时间：2024/05/21 09:36
int divide(int dividend, int divisor) {if(dividend == INT32_MIN){ if(divisor == 1)return INT32_MIN; if(divisor == -1) return INT32_MAX;}if(divisor == 0){ if(dividend > 0)return INT32_MAX; if(dividend < 0)return INT32_MIN; else return 0;}long dividend_l = dividend;long divisor_l = divisor;int sign = ((dividend_l<0)^(divisor_l<0))?-1:1;dividend_l = abs(dividend_l);divisor_l = abs(divisor_l);long ret = 0;while(dividend_l>=divisor_l){ long q = 1 , tmp = divisor_l; while( dividend_l >= (tmp<<1) ){ cout<<tmp<<endl; tmp = tmp << 1; q = q << 1; } ret = ret + q; dividend_l = dividend_l - tmp;}} 0 0
- [LeetCode]29.Divide Two Integers
- LeetCode --- 29. Divide Two Integers
- LeetCode 29.Divide Two Integers
- [Leetcode] 29. Divide Two Integers
- 【leetcode】29. Divide Two Integers
- *LeetCode 29. Divide Two Integers
- leetcode 29. Divide Two Integers
- leetcode 29. Divide Two Integers
- [LeetCode]29. Divide Two Integers
- LeetCode 29. Divide Two Integers
- LeetCode 29. Divide Two Integers
- leetcode 29. Divide Two Integers
- LeetCode-29.Divide Two Integers
- leetcode 29. Divide Two Integers
- leetcode 29. Divide Two Integers
- [leetcode]29. Divide Two Integers
- leetcode 29. Divide Two Integers
- LeetCode - 29. Divide Two Integers
- 基于ijkplayer+Rxjava+Rxandroid+Retrofit2.0+MVP+Material Design的android万能播放器
- Android studio 导出不包含asset资源文件的jar包
- 自定义dialog
- EventBus使用详解(一)——初步使用EventBus
- elasticsearch2.3安装以及集群部署
- leetcode 29. Divide Two Integers
- 论一个真正的软件测试工程师
- 格子类型游戏实践源项目
- boost::enable_shared_from_this的用法
- 分析（Android下的任务和Activity栈）
- windows写的txt mac打开是乱码, 浏览器也打不开
- Android开发入门——Android系统介绍和开发环境的搭建
- 代码 P1SEL2产生的疑问
- Hive CLI – Migrating to Beeline
