题目：

题解：

class Solution {
public:int divide(int dividend, int divisor) {// 考虑被除数为最小值的情况if (dividend == INT_MIN) {if (divisor == 1) {return INT_MIN;}if (divisor == -1) {return INT_MAX;}}// 考虑除数为最小值的情况if (divisor == INT_MIN) {return dividend == INT_MIN ? 1 : 0;}// 考虑被除数为 0 的情况if (dividend == 0) {return 0;}// 一般情况，使用类二分查找// 将所有的正数取相反数，这样就只需要考虑一种情况bool rev = false;if (dividend > 0) {dividend = -dividend;rev = !rev;}if (divisor > 0) {divisor = -divisor;rev = !rev;}vector<int> candidates = {divisor};// 注意溢出while (candidates.back() >= dividend - candidates.back()) {candidates.push_back(candidates.back() + candidates.back());}int ans = 0;for (int i = candidates.size() - 1; i >= 0; --i) {if (candidates[i] >= dividend) {ans += (1 << i);dividend -= candidates[i];}}return rev ? -ans : ans;}
};