Leetcode 29. 两数相除（DAY 166）---- LeetCode 精选 TOP 面试题

男娘i 2022-09-10 14:18 177阅读 0赞

### 文章目录 ###

*   *  原题题目
     *  代码实现（首刷绝大部分看解）

--------------------

## 原题题目 ##

--------------------

![在这里插入图片描述][watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBATG92ZSA2_size_20_color_FFFFFF_t_70_g_se_x_16]

--------------------

## 代码实现（首刷绝大部分看解） ##

--------------------

class Solution { 
    public:
        int divide(int dividend, int divisor) { 
            if(dividend == 0)   return 0;
            if(dividend == INT_MIN && divisor == -1)    return INT_MAX;
            if(dividend == INT_MIN && divisor == 1) return INT_MIN;
            bool neg = false;
            if(dividend < 0)    neg ^= true;
            if(divisor < 0)     neg ^= true;
            long divid = abs((long)dividend),divis = abs((long)divisor),divnum,tmpnum,ret = 0;
            while(divid >= divis)
            { 
                for(divnum=31;divnum>=0;--divnum)
                { 
                    tmpnum = divid;
                    tmpnum >>= divnum;
                    if(tmpnum >= divis)
                    { 
                        if(divnum == 0) ++ret;
                        else    ret += (2<<(divnum-1));
                        break;
                    }   
                }
                divid -= (divis << divnum);
            }
            ret = neg ? -ret : ret;
            if(ret > INT_MAX) ret = INT_MAX;
            return ret;
        }
    };

[watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBATG92ZSA2_size_20_color_FFFFFF_t_70_g_se_x_16]: /images/20220829/70039f58a9eb44fd9a007331a8b67515.png