240523

Author: aluferraz

src/Main.java

@@ -22,6 +22,7 @@
 import leetcode.editor.en.Q639.DecodeWaysIi;
 import leetcode.editor.en.Q649.Dota2Senate;
 import leetcode.editor.en.Q651.FourKeysKeyboard;
+import leetcode.editor.en.Q703.KthLargestElementInAStream;
 import leetcode.editor.en.Q785.IsGraphBipartite;
 import leetcode.editor.en.Q91.DecodeWays;
 import leetcode.editor.en.Q934.ShortestBridge;
@@ -39,7 +40,12 @@
 public class Main {
     public static void main(String[] args) throws IOException {
 
-        System.out.println(new FrogJump().canCross(toIntArray("[0,1,3,6,10,15,19,21,24,26,30,33]\n")));
+        KthLargestElementInAStream kthLargest = new KthLargestElementInAStream(3, new int[]{4, 5, 8, 2});
+        kthLargest.add(3);   // return 4
+        kthLargest.add(5);   // return 5
+        kthLargest.add(10);  // return 5
+        kthLargest.add(9);   // return 8
+        kthLargest.add(4);   // return 8
 
     }
 

src/leetcode/editor/en/Q1134/ArmstrongNumber.java

@@ -0,0 +1,24 @@
+package leetcode.editor.en.Q1134;
+
+import java.util.*;
+
+import javafx.util.Pair;
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+    public boolean isArmstrong(int n) {
+        String s = String.valueOf(n);
+        int power = s.length();
+        int sum = 0;
+        for (int i = 0; i < s.length(); i++) {
+            sum += Math.pow(Character.getNumericValue(s.charAt(i)), power);
+        }
+        return sum == n;
+
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+
+public class ArmstrongNumber extends Solution {
+}

src/leetcode/editor/en/Q703/KthLargestElementInAStream.java

@@ -0,0 +1,68 @@
+package leetcode.editor.en.Q703;
+
+import java.util.*;
+
+import javafx.util.Pair;
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class KthLargest {
+
+    LinkedList<Integer> nums;
+    int k;
+
+    public KthLargest(int k, int[] nums) {
+        this.k = k;
+        PriorityQueue<Integer> pq = new PriorityQueue<>(Comparator.reverseOrder());
+        for (int num : nums) {
+            pq.add(num);
+        }
+        this.nums = new LinkedList<>();
+        for (int i = 0; i < k && !pq.isEmpty(); i++) {
+            this.nums.addFirst(pq.poll());
+        }
+
+    }
+
+
+    public int add(int val) {
+        int indexToInsert = binarySearch(val);
+        if (indexToInsert < this.nums.size()) {
+            this.nums.add(indexToInsert, val);
+        } else {
+            this.nums.add(val);
+        }
+        if (this.nums.size() > k) this.nums.pollFirst();
+        int ans = this.nums.get(this.nums.size() - k);
+        return ans;
+    }
+
+    private int binarySearch(int target) {
+        int left = 0;
+        int right = this.nums.size();
+        while (left < right) {
+            int mid = (left + right) / 2;
+            if (this.nums.get(mid) < target) {
+                left = mid + 1;
+            } else {
+                right = mid;
+            }
+        }
+        return left;
+
+    }
+}
+
+/**
+ * Your KthLargest object will be instantiated and called as such:
+ * KthLargest obj = new KthLargest(k, nums);
+ * int param_1 = obj.add(val);
+ */
+//leetcode submit region end(Prohibit modification and deletion)
+
+
+public class KthLargestElementInAStream extends KthLargest {
+
+    public KthLargestElementInAStream(int k, int[] nums) {
+        super(k, nums);
+    }
+}