2022-05-30 Daily-Challenge

Today I have done leetcode's May LeetCoding Challenge with cpp.

May LeetCoding Challenge 30

Description

Divide Two Integers

Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator.

The integer division should truncate toward zero, which means losing its fractional part. For example, 8.345 would be truncated to 8, and -2.7335 would be truncated to -2.

Return the quotient after dividing dividend by divisor.

Note: Assume we are dealing with an environment that could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For this problem, if the quotient is strictly greater than 231 - 1, then return 231 - 1, and if the quotient is strictly less than -231, then return -231.

 

Example 1:

Input: dividend = 10, divisor = 3
Output: 3
Explanation: 10/3 = 3.33333.. which is truncated to 3.

Example 2:

Input: dividend = 7, divisor = -3
Output: -2
Explanation: 7/-3 = -2.33333.. which is truncated to -2.

 

Constraints:

  • -231 <= dividend, divisor <= 231 - 1
  • divisor != 0

Solution

class Solution {
  int answer = 0;
  int minus(int current, int base, int resultBase) {
    if(current > base) {
      return current;
    }
    if(base >= INT_MIN / 2) current = minus(current, base + base, resultBase + resultBase);
    if(current > base) {
      return current;
    }
    current -= base;
    answer += resultBase;
    return current;
  }
public:
  int divide(int dividend, int divisor) {
    if(dividend == INT_MIN && divisor == -1) return INT_MAX;
    int sign = 1;
    if(dividend > 0) {
      sign = -1;
      dividend = 0 - dividend;
    }
    if(divisor > 0) {
      sign = sign == 1 ? -1 : 1;
      divisor = 0 - divisor;
    }
    minus(dividend, divisor, -1);
    answer = sign == 1 ? 0 - answer : answer;
    return answer;
  }
};

// Accepted
// 992/992 cases passed (0 ms)
// Your runtime beats 100 % of cpp submissions
// Your memory usage beats 76.09 % of cpp submissions (5.9 MB)