solves divide two integers

Author: anishLearnsToCode

README.md

@@ -35,6 +35,7 @@
 |  26  | [Remove Duplicates From Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)                                                 |                  [![Java](assets/java.png)](src/RemoveDuplicatesFromSortedArray.java) [![Python](assets/python.png)](python/remove_duplicates_from_sorted_array.py)                  |                                                                                                                                   |
 |  27  | [Remove Element](https://leetcode.com/problems/remove-element/)                                                                                           |                                     [![Java](assets/java.png)](src/RemoveElement.java) [![Python](assets/python.png)](python/remove_element.py)                                      |                                                                                                                                   |
 |  28  | [Needle in Haystack](https://leetcode.com/problems/implement-strstr)                                                                                      |                                  [![Java](assets/java.png)](src/NeedleInHaystack.java) [![Python](assets/python.png)](python/needle_in_haystack.py)                                  |                                                                                                                                   |
+|  29  | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers)                                                                                  |                                                                [![Java](assets/java.png)](src/DivideTwoIntegers.java)                                                                |                                                                                                                                   |
 |  35  | [Search Inserted Position](https://leetcode.com/problems/search-insert-position/)                                                                         |                              [![Java](assets/java.png)](src/SearchInsertPosition.java) [![Python](assets/python.png)](python/search_insert_position.py)                              |                                                                                                                                   |
 |  38  | [Count and Say](https://leetcode.com/problems/count-and-say)                                                                                              |                                       [![Java](assets/java.png)](src/CountAndSay.java) [![Python](assets/python.png)](python/count_and_say.py)                                       |                                                                                                                                   |
 |  53  | [Maximum SubArray](https://leetcode.com/problems/maximum-subarray)                                                                                        |                                 [![Java](assets/java.png)](src/MaximumSubArray.java) [![Python](assets/python.png)](python/maximum_sum_subarray.py)                                  |                                                                                                                                   |

src/DivideTwoIntegers.java

@@ -0,0 +1,16 @@
+// https://leetcode.com/problems/divide-two-integers
+// T: O(A / B)
+// S: O(1)
+
+public class DivideTwoIntegers {
+    public int divide(int A, int B) {
+        if (A == 1 << 31 && B == -1) return (1 << 31) - 1;
+        int a = Math.abs(A), b = Math.abs(B), res = 0, x = 0;
+        while (a - b >= 0) {
+            for (x = 0; a - (b << x << 1) >= 0; x++);
+            res += 1 << x;
+            a -= b << x;
+        }
+        return (A > 0) == (B > 0) ? res : -res;
+    }
+}