Added code for problems solved in Weekly contest 103

varunu28 · varunu28 · commit 56b9a57760a0 · 2018-09-22T20:03:02.000-07:00
diff --git a/Contests/Weekly Contest 103/Online Election.java b/Contests/Weekly Contest 103/Online Election.java
@@ -0,0 +1,46 @@
+class TopVotedCandidate {
+    int[] times;
+    int[] persons;
+    int[] winner;
+
+    public TopVotedCandidate(int[] persons, int[] times) {
+        this.times = times;
+        this.persons = persons;
+        int[] counter = new int[persons.length+1];
+        winner = new int[times.length];
+        int max = Integer.MIN_VALUE;
+        int maxPerson = -1;
+        int i = 0;
+
+        while (i < times.length) {
+            counter[persons[i]]++;
+            if (max < counter[persons[i]]) {
+                max = counter[persons[i]];
+                maxPerson = persons[i];
+            }
+            else if (max == counter[persons[i]]) {
+                maxPerson = persons[i];
+            }
+
+            winner[i] = maxPerson;
+
+            i++;
+        }
+    }
+
+    public int q(int t) {
+        int i = 0;
+        while (i < times.length && times[i] <= t) {
+            i++;
+        }
+
+        return winner[i-1];
+    }
+}
+
+
+/**
+ * Your TopVotedCandidate object will be instantiated and called as such:
+ * TopVotedCandidate obj = new TopVotedCandidate(persons, times);
+ * int param_1 = obj.q(t);
+ */
diff --git a/Contests/Weekly Contest 103/Smallest Range I.java b/Contests/Weekly Contest 103/Smallest Range I.java
@@ -0,0 +1,7 @@
+class Solution {
+
+    public static int smallestRangeI(int[] A, int K) {
+        Arrays.sort(A);
+        return Math.max((A[A.length-1] - K) - (A[0] + K), 0);
+    }
+}
