https://leetcode-cn.com/problems/divide-two-integers/submissions/

解決方案

class Solution {public int divide(int dividend, int divisor) { // 考慮被除數為最小值的情況if (dividend == Integer.MIN_VALUE) {if (divisor == 1) {return Integer.MIN_VALUE;}if (divisor == -1) {return Integer.MAX_VALUE;}} // 考慮除數為最小值的情況if (divisor == Integer.MIN_VALUE) {return dividend == Integer.MIN_VALUE ? 1 : 0;} // 考慮被除數為 0 的情況if (dividend == 0) {return 0;}// 一般情況，使用類二分查找// 將所有的正數取相反數，這樣就只需要考慮一種情況boolean rev = false;if (dividend > 0) {dividend = -dividend;rev = !rev;}if (divisor > 0) {divisor = -divisor;rev = !rev;}ans=0;solve(dividend,divisor,0);return rev ? -ans : ans;}int ans = 0;public int solve(int dividend,int divisor,int candidate){int temp = divisor<<candidate;if(temp<dividend){return dividend;}if(temp>=Integer.MIN_VALUE>>1){dividend = solve(dividend, divisor, candidate + 1);}if(temp>=dividend){ans += 1 << candidate;dividend -= temp;}return dividend;} }

總結

以上是生活随笔為你收集整理的LeetCode 29 两数相除的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。