[LeetCode] 29. Divide Two Integers

Divide Two Integers

Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator.
Return the quotient after dividing dividend by divisor.
The integer division should truncate toward zero.
Example 1:

Input: dividend = 10, divisor = 3
Output: 3

Example 2:

Input: dividend = 7, divisor = -3
Output: -2

Note:

Both dividend and divisor will be 32-bit signed integers.
The divisor will never be 0.
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For the purpose of this problem, assume that your function returns 231 − 1 when the division result overflows.

解析

用位运算

class Solution {
public:
    int divide(int num1, int num2){
        long long dividend = num1 < 0 ? -(long long)num1 : num1;
        long long divisor = num2 < 0 ? -(long long)num2 : num2;

        long long result = 0;
        while(dividend >= divisor){
            long long tmp = divisor;
            for(int i=0;dividend>=tmp;i++,tmp <<= 1){
                dividend -= tmp;
                result += (1<<i);
            }
        }
        if((num1^num2) <0)
            result = 0-result;
        if(result > INT_MAX || result < INT_MIN)
            return INT_MAX;
        return int(result); 
    }
    
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值