这个想法是在做leetcode 的题目29 Divide Two Integers时产生的,原题描述如下:
Divide two integers without using multiplication, division and mod operator.
If it is overflow, return MAX_INT.
这个想法是在做leetcode 的题目29 Divide Two Integers时产生的,原题描述如下:
Divide two integers without using multiplication, division and mod operator.
If it is overflow, return MAX_INT.