Replaced <>() with ()

kabirutd · Nov 27, 2019 · d4a47cd · d4a47cd
1 parent 11dd8da
commit d4a47cd
Show file tree

Hide file tree

Showing 37 changed files with 50 additions and 50 deletions.
diff --git a/10 Days of Statistics/Day 0 - Mean, Median, and Mode/Solution.java b/10 Days of Statistics/Day 0 - Mean, Median, and Mode/Solution.java
@@ -35,7 +35,7 @@ public static void main(String[] args) {
         }
 
         /* Calculate Mode - if there's a tie, choose the smaller number */
-        HashMap<Integer, Integer> map = new HashMap<>();
+        HashMap<Integer, Integer> map = new HashMap();
         int maxOccurrences = 0;
         int mode = Integer.MAX_VALUE;
         for (int num : array) {

diff --git a/30 Days of Code/Day 08 - Dictionaries and Maps/Solution.java b/30 Days of Code/Day 08 - Dictionaries and Maps/Solution.java
@@ -8,7 +8,7 @@ public static void main(String[] args) {
         /* Save input as entries in a HashMap */
         Scanner scan = new Scanner(System.in);
         int n = scan.nextInt();
-        HashMap<String, Integer> map = new HashMap<>();
+        HashMap<String, Integer> map = new HashMap();
         for (int i = 0; i < n; i++) {
             String name = scan.next();
             int phone   = scan.nextInt();

diff --git a/30 Days of Code/Day 18 - Queues and Stacks/Solution.java b/30 Days of Code/Day 18 - Queues and Stacks/Solution.java
@@ -7,7 +7,7 @@
 
 public class Solution {
     /* Stack - using an ArrayDeque */
-    ArrayDeque<Character> dequeAsStack = new ArrayDeque<>();
+    ArrayDeque<Character> dequeAsStack = new ArrayDeque();
 
     void pushCharacter(char ch) {
         dequeAsStack.push(ch);
@@ -18,7 +18,7 @@ char popCharacter() {
     }
 
     /* Queue - using an ArrayDeque */
-    ArrayDeque<Character> dequeAsQueue = new ArrayDeque<>();
+    ArrayDeque<Character> dequeAsQueue = new ArrayDeque();
 
     void enqueueCharacter(char ch) {
         dequeAsQueue.add(ch);

diff --git a/30 Days of Code/Day 23 - BST Level-Order Traversal/Solution.java b/30 Days of Code/Day 23 - BST Level-Order Traversal/Solution.java
@@ -17,7 +17,7 @@ static void levelOrder(Node root) {
         if (root == null) {
             return;
         }
-        ArrayDeque<Node> deque = new ArrayDeque<>(); // use deque as a queue
+        ArrayDeque<Node> deque = new ArrayDeque(); // use deque as a queue
         deque.add(root);
         while (!deque.isEmpty()) {
             Node n = deque.removeFirst();

diff --git a/Algorithms/Graph Theory/Breadth First Search - Shortest Reach/Solution.java b/Algorithms/Graph Theory/Breadth First Search - Shortest Reach/Solution.java
@@ -50,7 +50,7 @@ private static void findDistances(Node start) {
         if (start == null) {
             return;
         }
-        ArrayDeque<Node> deque = new ArrayDeque<>(); // use deque as a queue
+        ArrayDeque<Node> deque = new ArrayDeque(); // use deque as a queue
         start.distance = 0;
         deque.add(start);
         while (!deque.isEmpty()) {
@@ -73,7 +73,7 @@ public static class Node {
         public Node (int id) {
             this.id   = id;
             distance  = -1;
-            neighbors = new HashSet<>();
+            neighbors = new HashSet();
         }
 
         public void addNeighbor(Node neighbor) {

diff --git a/Algorithms/Search/Ice Cream Parlor/Solution.java b/Algorithms/Search/Ice Cream Parlor/Solution.java
@@ -22,7 +22,7 @@ public static void main(String[] args) {
     }
 
     public static void buyIceCream(int [] costs, int money) {
-        HashMap<Integer, Integer> map = new HashMap<>(); // key = cost, value = ice cream ID
+        HashMap<Integer, Integer> map = new HashMap(); // key = cost, value = ice cream ID
         for (int i = 0; i < costs.length; i++) {
             int icecreamID = i + 1;
             int cost       = costs[i];

diff --git a/Algorithms/Sorting/Quicksort 2 - Sorting/Solution.java b/Algorithms/Sorting/Quicksort 2 - Sorting/Solution.java
@@ -31,8 +31,8 @@ private static void quickSort(int [] array, int start, int end) {
     /* Partition/Quicksort "Stable Sort" version using O(n) space */
     private static int partition(int[] array, int start, int end) {
         int pivotValue = array[start]; // not a great choice of pivot
-        ArrayList<Integer> leftList  = new ArrayList<>();
-        ArrayList<Integer> rightList = new ArrayList<>();
+        ArrayList<Integer> leftList  = new ArrayList();
+        ArrayList<Integer> rightList = new ArrayList();
 
         for (int i = start + 1 ; i <= end; i++) {
             if (array[i] < pivotValue) {

diff --git a/Algorithms/Strings/Super Reduced String/Solution.java b/Algorithms/Strings/Super Reduced String/Solution.java
@@ -11,7 +11,7 @@
 
 String superReducedString(String str) {
     /* Iterate through String, creating final result in a Stack */
-    Stack<Character> stack = new Stack<>();
+    Stack<Character> stack = new Stack();
     for (int i = 0; i < str.length(); i++) {
         Character ch = str.charAt(i);
         if (!stack.isEmpty() && ch == stack.peek()) {

diff --git a/Algorithms/Strings/Weighted Uniform Strings/Solution.java b/Algorithms/Strings/Weighted Uniform Strings/Solution.java
@@ -22,7 +22,7 @@ public static void main(String[] args) {
     }
 
     private static HashSet<Integer> getWeights(String str) {
-        HashSet<Integer> weights = new HashSet<>();
+        HashSet<Integer> weights = new HashSet();
         int weight = 0;
         char prev = ' '; // so it doesn't match 1st character
         for (int i = 0; i < str.length(); i++) {

diff --git a/Cracking the Coding Interview/Algorithms/BFS - Shortest Reach in a Graph/Solution.java b/Cracking the Coding Interview/Algorithms/BFS - Shortest Reach in a Graph/Solution.java
@@ -50,7 +50,7 @@ private static void findDistances(Node start) {
         if (start == null) {
             return;
         }
-        ArrayDeque<Node> deque = new ArrayDeque<>(); // use deque as a queue
+        ArrayDeque<Node> deque = new ArrayDeque(); // use deque as a queue
         start.distance = 0;
         deque.add(start);
         while (!deque.isEmpty()) {
@@ -73,7 +73,7 @@ public static class Node {
         public Node (int id) {
             this.id   = id;
             distance  = -1;
-            neighbors = new HashSet<>();
+            neighbors = new HashSet();
         }
 
         public void addNeighbor(Node neighbor) {

diff --git a/Cracking the Coding Interview/Algorithms/Binary Search - Ice Cream Parlor/Solution.java b/Cracking the Coding Interview/Algorithms/Binary Search - Ice Cream Parlor/Solution.java
@@ -22,7 +22,7 @@ public static void main(String[] args) {
     }
 
     public static void buyIceCream(int [] costs, int money) {
-        HashMap<Integer, Integer> map = new HashMap<>(); // key = cost, value = ice cream ID
+        HashMap<Integer, Integer> map = new HashMap(); // key = cost, value = ice cream ID
         for (int i = 0; i < costs.length; i++) {
             int icecreamID = i + 1;
             int cost       = costs[i];

diff --git a/Cracking the Coding Interview/Data Structures/Hash Tables - Ransom Note/Solution.java b/Cracking the Coding Interview/Data Structures/Hash Tables - Ransom Note/Solution.java
@@ -16,7 +16,7 @@ public static void checkMagazine(String[] magazine, String[] ransom) {
 
 /* Creates and returns a HashMap out of an array of Strings */
 private static HashMap<String, Integer> makeMap(String[] words) {
-    HashMap<String, Integer> map = new HashMap<>();
+    HashMap<String, Integer> map = new HashMap();
     for (int i = 0; i < words.length; i++) {
         map.merge(words[i], 1, Integer::sum);
     }

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
@@ -11,7 +11,7 @@
 
 public class Solution {
     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
+    private static PriorityQueue<Integer> minHeap = new PriorityQueue();                           // keeps track of the LARGE numbers
 
     public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);

diff --git a/Cracking the Coding Interview/Data Structures/Queue - A Tale of Two Stacks/Solution.java b/Cracking the Coding Interview/Data Structures/Queue - A Tale of Two Stacks/Solution.java
@@ -24,8 +24,8 @@ public static void main(String[] args) {
     }
 
     public static class MyQueue<Integer> {
-        private Stack<Integer> stack1 = new Stack<>();
-        private Stack<Integer> stack2 = new Stack<>();
+        private Stack<Integer> stack1 = new Stack();
+        private Stack<Integer> stack2 = new Stack();
 
         public void enqueue(Integer num) {
             stack1.push(num);

diff --git a/Cracking the Coding Interview/Data Structures/Stacks - Balanced Brackets/Solution.java b/Cracking the Coding Interview/Data Structures/Stacks - Balanced Brackets/Solution.java
@@ -7,7 +7,7 @@
 
 /* Create HashMap to match opening brackets with closing brackets */
 static String isBalanced(String expression) {
-    HashMap<Character, Character> map = new HashMap<>();
+    HashMap<Character, Character> map = new HashMap();
     map.put('(', ')');
     map.put('[', ']');
     map.put('{', '}');
@@ -18,7 +18,7 @@ private static boolean isBalanced(String expression, HashMap<Character, Characte
     if ((expression.length() % 2) != 0) {
         return false; // odd length Strings are not balanced
     }        
-    ArrayDeque<Character> deque = new ArrayDeque<>(); // use deque as a stack
+    ArrayDeque<Character> deque = new ArrayDeque(); // use deque as a stack
     for (int i = 0; i < expression.length(); i++) {
         Character ch = expression.charAt(i);
         if (map.containsKey(ch)) {

diff --git a/Cracking the Coding Interview/Data Structures/Tries - Contacts/Solution.java b/Cracking the Coding Interview/Data Structures/Tries - Contacts/Solution.java
@@ -23,7 +23,7 @@ public static void main(String[] args) {
 
 /* Based loosely on tutorial video in this problem */
 class TrieNode {
-    private HashMap<Character, TrieNode> children = new HashMap<>();
+    private HashMap<Character, TrieNode> children = new HashMap();
     public int size = 0; // this was the main trick to decrease runtime to pass tests.
 
     public void putChildIfAbsent(char ch) {

diff --git a/...king the Coding Interview/Techniques, Concepts/Recursion - Davis' Staircase/Solution.java b/...king the Coding Interview/Techniques, Concepts/Recursion - Davis' Staircase/Solution.java
@@ -11,7 +11,7 @@
 // Can alternatively be solved in O(1) space (per testcase) by using iteration instead of recursion
 
 public class Solution {
-    private static HashMap<Integer, Integer> cache = new HashMap<>();
+    private static HashMap<Integer, Integer> cache = new HashMap();
 
     public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);

diff --git a/Data Structures/Arrays/Dynamic Array/Solution.java b/Data Structures/Arrays/Dynamic Array/Solution.java
@@ -11,7 +11,7 @@ public static void main(String[] args) {
         int lastAns = 0;
 
         /* Create 2-D ArrayList */
-        ArrayList<ArrayList<Integer>> lists = new ArrayList<>();
+        ArrayList<ArrayList<Integer>> lists = new ArrayList();
         for (int i = 0; i < N; i++) {
             lists.add(new ArrayList<Integer>());
         }

diff --git a/Data Structures/Arrays/Sparse Arrays/Solution.java b/Data Structures/Arrays/Sparse Arrays/Solution.java
@@ -10,7 +10,7 @@ public static void main(String[] args) {
         scan.nextLine(); // gets rid of pesky newline
 
         /* Create and fill HashMap */
-        HashMap<String, Integer> map  = new HashMap<>();
+        HashMap<String, Integer> map  = new HashMap();
         for (int i = 0; i < N; i++) {
             String str = scan.nextLine();
             map.merge(str, 1, Integer::sum);

diff --git a/Data Structures/Heaps/Find the Running Median/Solution.java b/Data Structures/Heaps/Find the Running Median/Solution.java
@@ -11,7 +11,7 @@
 
 public class Solution {
     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
+    private static PriorityQueue<Integer> minHeap = new PriorityQueue();                           // keeps track of the LARGE numbers
 
     public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);

diff --git a/Data Structures/Queues/Queue using Two Stacks/Solution.java b/Data Structures/Queues/Queue using Two Stacks/Solution.java
@@ -24,8 +24,8 @@ public static void main(String[] args) {
     }
 
     public static class MyQueue<Integer> {
-        private Stack<Integer> stack1 = new Stack<>();
-        private Stack<Integer> stack2 = new Stack<>();
+        private Stack<Integer> stack1 = new Stack();
+        private Stack<Integer> stack2 = new Stack();
 
         public void enqueue(Integer num) {
             stack1.push(num);

diff --git a/Data Structures/Stacks/Balanced Brackets/Solution.java b/Data Structures/Stacks/Balanced Brackets/Solution.java
@@ -12,7 +12,7 @@
 public class Solution {
     public static void main(String[] args) {
         /* Create HashMap to match opening brackets with closing brackets */
-        HashMap<Character, Character> map = new HashMap<>();
+        HashMap<Character, Character> map = new HashMap();
         map.put('(', ')');
         map.put('[', ']');
         map.put('{', '}');
@@ -31,7 +31,7 @@ private static boolean isBalanced(String expression, HashMap<Character, Characte
         if ((expression.length() % 2) != 0) {
             return false; // odd length Strings are not balanced
         }        
-        ArrayDeque<Character> deque = new ArrayDeque<>(); // use deque as a stack
+        ArrayDeque<Character> deque = new ArrayDeque(); // use deque as a stack
         for (int i = 0; i < expression.length(); i++) {
             Character ch = expression.charAt(i);
             if (map.containsKey(ch)) {

diff --git a/Data Structures/Trees/Tree - Level Order Traversal/Solution.java b/Data Structures/Trees/Tree - Level Order Traversal/Solution.java
@@ -12,7 +12,7 @@ class Node {
 // Space Complexity: O(n)
 
 void LevelOrder(Node root) {
-    ArrayDeque<Node> deque = new ArrayDeque<>(); // use deque as a queue
+    ArrayDeque<Node> deque = new ArrayDeque(); // use deque as a queue
     if (root != null) {
         deque.add(root);
     }

diff --git a/Data Structures/Trie/Contacts/Solution.java b/Data Structures/Trie/Contacts/Solution.java
@@ -23,7 +23,7 @@ public static void main(String[] args) {
 
 /* Based loosely on tutorial video in this problem */
 class TrieNode {
-    private HashMap<Character, TrieNode> children = new HashMap<>();
+    private HashMap<Character, TrieNode> children = new HashMap();
     public int size = 0; // this was the main trick to decrease runtime to pass tests.
 
     public void putChildIfAbsent(char ch) {

diff --git a/General Programming/Basic Programming/Minimum Distances/Solution.java b/General Programming/Basic Programming/Minimum Distances/Solution.java
@@ -12,7 +12,7 @@
 
 // Complete the minimumDistances function below.
 static int minimumDistances(int[] array) {
-    HashMap<Integer, Integer> map = new HashMap<>();
+    HashMap<Integer, Integer> map = new HashMap();
     int minDistance = Integer.MAX_VALUE;
     for (int i = 0; i < array.length; i++) {
         if (map.containsKey(array[i])) {

diff --git a/General Programming/Basic Programming/Sock Merchant/Solution.java b/General Programming/Basic Programming/Sock Merchant/Solution.java
@@ -10,7 +10,7 @@ public static void main(String[] args) {
         int n = scan .nextInt();
 
         /* Count pairs */
-        HashSet<Integer> set = new HashSet<>();
+        HashSet<Integer> set = new HashSet();
         int pairs = 0;
         for (int i = 0; i < n; i++) {
             int cost = scan.nextInt();

diff --git a/Implementation/Brute Force/Pangrams/Solution.java b/Implementation/Brute Force/Pangrams/Solution.java
@@ -9,7 +9,7 @@ public static void main(String[] args) {
         String str = scan.nextLine().toLowerCase();
         scan.close();
 
-        HashSet<Character> set = new HashSet<>();
+        HashSet<Character> set = new HashSet();
         for (int i = 0; i < str.length(); i++) {
             char ch = str.charAt(i);
             if (Character.isLetter(ch)) {

diff --git a/Java/Advanced/Java Reflection - Attributes/Solution.java b/Java/Advanced/Java Reflection - Attributes/Solution.java
@@ -6,7 +6,7 @@ public static void main(String[] args) {
         Method[] methods = student.getDeclaredMethods();
 
         /* Get names from Methods */
-        ArrayList<String> methodNames = new ArrayList<>();
+        ArrayList<String> methodNames = new ArrayList();
         for (Method method : methods) {
             methodNames.add(method.getName());
         }

diff --git a/Java/Advanced/Java Varargs - Simple Addition/Solution.java b/Java/Advanced/Java Varargs - Simple Addition/Solution.java
@@ -39,7 +39,7 @@ public static void main(String[] args) {
             ob.add(n1,n2,n3,n4,n5); 
             ob.add(n1,n2,n3,n4,n5,n6);
             Method[] methods = Add.class.getDeclaredMethods();
-            Set<String> set = new HashSet<>();
+            Set<String> set = new HashSet();
             boolean overload = false;
             for (int i = 0; i < methods.length; i++) {
                 if (set.contains(methods[i].getName())) {

diff --git a/Java/Advanced/Java Visitor Pattern/Solution.java b/Java/Advanced/Java Visitor Pattern/Solution.java
@@ -41,7 +41,7 @@ public int getDepth() {
 }
 
 class TreeNode extends Tree {
-    private ArrayList<Tree> children = new ArrayList<>();
+    private ArrayList<Tree> children = new ArrayList();
 
     public TreeNode(int value, Color color, int depth) {
         super(value, color, depth);
@@ -168,15 +168,15 @@ public static Tree solve() {
             /* Edges are undirected: Add 1st direction */
             HashSet<Integer> uNeighbors = map.get(u);
             if (uNeighbors == null) {                
-                uNeighbors = new HashSet<>();
+                uNeighbors = new HashSet();
                 map.put(u, uNeighbors);
             }
             uNeighbors.add(v);
 
             /* Edges are undirected: Add 2nd direction */
             HashSet<Integer> vNeighbors = map.get(v);
             if (vNeighbors == null) {
-                vNeighbors = new HashSet<>();
+                vNeighbors = new HashSet();
                 map.put(v, vNeighbors);
             }
             vNeighbors.add(u);

diff --git a/Java/Advanced/Prime Checker/Solution.java b/Java/Advanced/Prime Checker/Solution.java
@@ -52,7 +52,7 @@ public static void main(String[] args) {
             ob.checkPrime(n1,n2,n3);
             ob.checkPrime(n1,n2,n3,n4,n5);
             Method[] methods = Prime.class.getDeclaredMethods();
-            Set<String> set = new HashSet<>();
+            Set<String> set = new HashSet();
             boolean overload = false;
             for (int i = 0; i < methods.length; i++) {
                 if (set.contains(methods[i].getName())) {

diff --git a/Java/Data Structures/Java ArrayList/Solution.java b/Java/Data Structures/Java ArrayList/Solution.java
@@ -9,10 +9,10 @@ public static void main(String[] args) {
         int n = scan.nextInt();
 
         /* Save numbers in 2-D ArrayList */
-        ArrayList<ArrayList<Integer>> lists = new ArrayList<>();
+        ArrayList<ArrayList<Integer>> lists = new ArrayList();
         for (int row = 0; row < n; row++) {
             int d = scan.nextInt();
-            ArrayList<Integer> list = new ArrayList<>();
+            ArrayList<Integer> list = new ArrayList();
             for (int col = 0; col < d; col++) {
                 list.add(scan.nextInt());
             }

diff --git a/Java/Data Structures/Java Dequeue/Solution.java b/Java/Data Structures/Java Dequeue/Solution.java
@@ -14,8 +14,8 @@
 
 public class test {
     public static void main(String[] args) {
-        HashMap<Integer, Integer> map = new HashMap<>();
-        ArrayDeque<Integer> deque     = new ArrayDeque<>();
+        HashMap<Integer, Integer> map = new HashMap();
+        ArrayDeque<Integer> deque     = new ArrayDeque();
 
         Scanner scan = new Scanner(System.in);
         int n = scan.nextInt();

diff --git a/Java/Data Structures/Java List/Solution.java b/Java/Data Structures/Java List/Solution.java
@@ -8,7 +8,7 @@ public static void main(String[] args) {
         /* Create and fill Linked List of Integers */
         Scanner scan = new Scanner(System.in);
         int N = scan.nextInt();
-        LinkedList<Integer> list = new LinkedList<>();
+        LinkedList<Integer> list = new LinkedList();
         for (int i = 0; i < N; i++) {
             int value = scan.nextInt();
             list.add(value);

diff --git a/Java/Data Structures/Java Map/Solution.java b/Java/Data Structures/Java Map/Solution.java
@@ -12,7 +12,7 @@ public static void main(String[] args) throws IOException {
         /* Save input as entries in a HashMap */
         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
         int n = Integer.parseInt(br.readLine());
-        HashMap<String, Integer> map = new HashMap<>();
+        HashMap<String, Integer> map = new HashMap();
         while (n-- > 0) {
             String name = br.readLine();
             int phone   = Integer.parseInt(br.readLine());