Solved 3 questions

varunu28 · varunu28 · commit 773e29744c78 · 2017-12-23T15:02:21.000-08:00
diff --git a/Medium/Divide Two Integers.java b/Medium/Divide Two Integers.java
@@ -0,0 +1,41 @@
+class Solution {
+    public int divide(int dividend, int divisor) {
+        
+        boolean isNeg = false;
+        if ((dividend < 0 && divisor > 0) || (dividend > 0 && divisor < 0)) {
+            isNeg = true;
+        }
+        
+        int ans = 0;
+        
+        long Ldividend = Math.abs((long) dividend);
+        long Ldivisor = Math.abs((long) divisor);
+        
+        if (Ldivisor == 0) return Integer.MAX_VALUE;
+        if (Ldividend == 0 || (Ldividend < Ldivisor)) return 0;
+        
+        long quot = ldivide(Ldividend, Ldivisor);
+        
+        if(quot > Integer.MAX_VALUE) {
+            ans = isNeg == false ? Integer.MAX_VALUE : Integer.MIN_VALUE;
+        }
+        else {
+            ans = (int)(isNeg ? -quot : quot);
+        }
+        
+        return ans;
+    }
+    
+    private long ldivide(long ldividend, long ldivisor) {
+        if (ldividend < ldivisor) return 0;
+        
+        long sum = ldivisor;
+        long multiple = 1;
+        while ((sum+sum) <= ldividend) {
+            sum += sum;
+            multiple += multiple;
+        }
+
+        return multiple + ldivide(ldividend - sum, ldivisor);
+    }
+}
diff --git a/Medium/Minimum Time Difference.java b/Medium/Minimum Time Difference.java
@@ -0,0 +1,23 @@
+class Solution {
+    public int findMinDifference(List<String> timePoints) {
+        int[] mins = new int[timePoints.size()];
+        int i = 0;
+        for (String s : timePoints) {
+            int hr = Integer.parseInt(s.split(":")[0]);
+            int ms = Integer.parseInt(s.split(":")[1]);
+            
+            mins[i] = hr*60 + ms;
+            i++;
+        }
+        
+        Arrays.sort(mins);
+        
+        int minTime = Integer.MAX_VALUE;
+        
+        for(int j=1;j<mins.length;j++) {
+            minTime = Math.min(minTime, mins[j] - mins[j-1]);
+        }
+
+        return Math.min(minTime, mins[0] + 1440 - mins[mins.length-1]);
+    }
+}
diff --git a/Medium/Shuffle an Array.java b/Medium/Shuffle an Array.java
@@ -0,0 +1,40 @@
+class Solution {
+    
+    private int[] nums;
+    private Random random;
+
+    public Solution(int[] nums) {
+        this.nums = nums;
+        random = new Random();
+    }
+    
+    /** Resets the array to its original configuration and return it. */
+    public int[] reset() {
+        return nums;
+    }
+    
+    /** Returns a random shuffling of the array. */
+    public int[] shuffle() {
+        if (nums == null) return null;
+        int[] shuf = nums.clone();
+        for (int i=1;i<shuf.length;i++) {
+            int l = random.nextInt(i+1);
+            swap(shuf, i, l);
+        }
+        
+        return shuf;
+    }
+    
+    private void swap(int[] arr, int a, int b) {
+        int temp = arr[a];
+        arr[a] = arr[b];
+        arr[b] = temp;
+    }
+}
+
+/**
+ * Your Solution object will be instantiated and called as such:
+ * Solution obj = new Solution(nums);
+ * int[] param_1 = obj.reset();
+ * int[] param_2 = obj.shuffle();
+ */
