首页 > 代码库 > Divide Two Integers
Divide Two Integers
题目
Divide two integers without using multiplication, division and mod operator.
方法
将除数倍加,直到大于被除数。public int divide(int dividend, int divisor) { int flag = 0; if((dividend < 0 && divisor > 0) || (dividend > 0 && divisor < 0)){ flag = 1; } long divid = Math.abs((long)dividend); long divis = Math.abs((long)divisor); long n; int quotient = 0; int quo = 0; while(divid >= divis){ n = divis; quo = 1; while(n + n <= divid){ n = n + n; quo = quo + quo; } divid =divid - n; quotient += quo; } if(flag == 1){ return -quotient; } return quotient; }
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。