Commit aa40721

committed

add: Divide Two Integers

1 parent 8c4399f commit aa40721Copy full SHA for aa40721

File tree

+56

-0

lines changed

+56

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -16,6 +16,7 @@ This is the solution collection of my LeetCode problems, most of them are progra`
`16`	`16`	`\|19\|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) \| [JavaScript](./src/remove-nth-node-from-end-of-list/res.js)\|Medium\|`
`17`	`17`	`\|22\|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) \| [JavaScript](./src/generate-parentheses/res.js)\|Medium\|`
`18`	`18`	`\|26\|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) \| [JavaScript](./src/remove-duplicates-from-sorted-array/res.js)\|Easy\|`
	`19`	`+\|29\|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) \| [JavaScript](./src/divide-two-integers/res.js)\|Medium\|`
`19`	`20`	`\|33\|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) \| [JavaScript](./src/search-in-rotated-sorted-array/res.js)\|Medium\|`
`20`	`21`	`\|34\|[Search for a Range](https://leetcode.com/problems/search-for-a-range/) \| [JavaScript](./src/search-for-a-range/res.js)\|Medium\|`
`21`	`22`	`\|48\|[Rotate Image](https://leetcode.com/problems/rotate-image/) \| [JavaScript](./src/rotate-image/res.js)\|Medium\|`

Lines changed: 55 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,55 @@`
	`1`	`+/**`
	`2`	`+ * res.js`
	`3`	`+ * @authors Joe Jiang (hijiangtao@gmail.com)`
	`4`	`+ * @date 2017年03月01日 21:57:06`
	`5`	`+ * @version $Id$`
	`6`	`+ */`
	`7`	`+`
	`8`	`+/**`
	`9`	`+ * Divide two integers without using multiplication, division and mod operator.`
	`10`	`+ *`
	`11`	`+ * If it is overflow, return MAX_INT.`
	`12`	`+ *`
	`13`	`+ * Pay attention to Javascript Bitwise operators`
	`14`	`+ * http://www.ecma-international.org/ecma-262/5.1/#sec-11.10`
	`15`	`+ *`
	`16`	`+ * @param {number} dividend`
	`17`	`+ * @param {number} divisor`
	`18`	`+ * @return {number}`
	`19`	`+ */`
	`20`	`+let divide = function(dividend, divisor) {`
	`21`	`+ let MIN_INT = -2147483648,`
	`22`	`+ MAX_INT = 2147483647,`
	`23`	`+ positive = 0;`
	`24`	`+`
	`25`	`+ if(!divisor \|\| (dividend === MIN_INT && divisor === -1)) {`
	`26`	`+ return MAX_INT;`
	`27`	`+ }`
	`28`	`+`
	`29`	`+ let res = 0;`
	`30`	`+ if (dividend < 0) {`
	`31`	`+ dividend = -dividend;`
	`32`	`+ positive += 1;`
	`33`	`+ }`
	`34`	`+ if (divisor < 0) {`
	`35`	`+ divisor = -divisor;`
	`36`	`+ positive += 1;`
	`37`	`+ }`
	`38`	`+`
	`39`	`+ while (dividend >= divisor) {`
	`40`	`+ let tmpres = 1, tmpdiv = divisor;`
	`41`	`+`
	`42`	`+ while ((dividend >> 1) >= tmpdiv) {`
	`43`	`+ tmpres <<= 1;`
	`44`	`+ tmpdiv <<= 1;`
	`45`	`+ }`
	`46`	`+ res += tmpres;`
	`47`	`+ dividend -= tmpdiv;`
	`48`	`+ }`
	`49`	`+`
	`50`	`+ if (positive === 1) {`
	`51`	`+ return -res;`
	`52`	`+ }`
	`53`	`+`
	`54`	`+ return res;`
	`55`	`+};`

Comments

(0)