Removed <>

oscarjz · Dec 23, 2019 · 34a59ed · 34a59ed
1 parent d4a47cd
commit 34a59ed
Show file tree

Hide file tree

Showing 6 changed files with 6 additions and 6 deletions.
diff --git a/Algorithms/Sorting/Luck Balance/Solution.java b/Algorithms/Sorting/Luck Balance/Solution.java
@@ -14,7 +14,7 @@ public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int N = scan.nextInt();
         int K = scan.nextInt();
-        ArrayList<Integer> contest = new ArrayList<>(N);
+        ArrayList<Integer> contest = new ArrayList(N);
         int savedLuck = 0;
         for (int i = 0; i < N; i++) {
             int luck = scan.nextInt();

diff --git a/Algorithms/Sorting/The Full Counting Sort/Solution.java b/Algorithms/Sorting/The Full Counting Sort/Solution.java
@@ -15,7 +15,7 @@ public static void main(String[] args) throws IOException {
         final int maxValue = 100;
 
         /* Create HashMap with empty "buckets" to put Strings into */
-        HashMap<Integer, ArrayList<String>> map = new HashMap<>(maxValue);
+        HashMap<Integer, ArrayList<String>> map = new HashMap(maxValue);
         for (int i = 0; i < maxValue; i++) {
             map.put(i, new ArrayList<String>());
         }

diff --git a/Cracking the Coding Interview/Data Structures/Heaps - Find the Running Median/Solution.java b/Cracking the Coding Interview/Data Structures/Heaps - Find the Running Median/Solution.java
@@ -10,7 +10,7 @@
 //    2) maxHeap.size() - 1 = minHeap.size()
 
 public class Solution {
-    private static PriorityQueue<Integer> maxHeap = new PriorityQueue<>(Collections.reverseOrder()); // keeps track of the SMALL numbers
+    private static PriorityQueue<Integer> maxHeap = new PriorityQueue(Collections.reverseOrder()); // keeps track of the SMALL numbers
     private static PriorityQueue<Integer> minHeap = new PriorityQueue();                           // keeps track of the LARGE numbers
 
     public static void main(String[] args) {

diff --git a/Data Structures/Heaps/Find the Running Median/Solution.java b/Data Structures/Heaps/Find the Running Median/Solution.java
@@ -10,7 +10,7 @@
 //    2) maxHeap.size() - 1 = minHeap.size()
 
 public class Solution {
-    private static PriorityQueue<Integer> maxHeap = new PriorityQueue<>(Collections.reverseOrder()); // keeps track of the SMALL numbers
+    private static PriorityQueue<Integer> maxHeap = new PriorityQueue(Collections.reverseOrder()); // keeps track of the SMALL numbers
     private static PriorityQueue<Integer> minHeap = new PriorityQueue();                           // keeps track of the LARGE numbers
 
     public static void main(String[] args) {

diff --git a/Java/Advanced/Java Visitor Pattern/Solution.java b/Java/Advanced/Java Visitor Pattern/Solution.java
@@ -152,7 +152,7 @@ public static Tree solve() {
         /* Save nodes and colors */
         values = new int[numNodes];
         colors = new Color[numNodes];
-        map = new HashMap<>(numNodes);
+        map = new HashMap(numNodes);
         for (int i = 0; i < numNodes; i++) {
             values[i] = scan.nextInt();
         }

diff --git a/Java/Data Structures/Java Hashset/Solution.java b/Java/Data Structures/Java Hashset/Solution.java
@@ -19,7 +19,7 @@ public static void main(String[] args) {
         }
         s.close();
 
-        HashSet<String> set = new HashSet<>(t);
+        HashSet<String> set = new HashSet(t);
         for (int i = 0; i < t; i++) {
             set.add(pair_left[i] + " " + pair_right[i]);
             System.out.println(set.size());