Replaced <>() with ()

Author: RodneyShag

Chp. 01 - Arrays and Strings/__Intro_ArrayList/IntroArrayList.java

@@ -7,7 +7,7 @@
 public class IntroArrayList {
     /* Merges 2 arrays into an ArrayList */
     public static ArrayList<String> merge(String[] words, String[] moreWords) {
-        ArrayList<String> result = new ArrayList<>();
+        ArrayList<String> result = new ArrayList();
         for (String word : words) {
             result.add(word);
         }

Chp. 02 - Linked Lists/_2_1_Remove_Dups/RemoveDups.java

@@ -7,7 +7,7 @@
 
 public class RemoveDups {
     static void removeDuplicates(Node head) {
-        Set<Integer> set = new HashSet<>();
+        Set<Integer> set = new HashSet();
         set.add(head.data);
         Node n = head;
         while (n.next != null) {

Chp. 02 - Linked Lists/_2_5_Sum_Lists/SumLists.java

@@ -40,8 +40,8 @@ public static Node addForwardOrder(Node m, Node n) {
             return n;
         }
 
-        Stack<Integer> stack1 = new Stack<>();
-        Stack<Integer> stack2 = new Stack<>();
+        Stack<Integer> stack1 = new Stack();
+        Stack<Integer> stack2 = new Stack();
 
         while (m != null) {
             stack1.push(m.data);

Chp. 03 - Stacks and Queues/_3_2_Stack_Min/StackMin.java

@@ -6,8 +6,8 @@
 
 public class StackMin {
     // Can alternatively use ArrayDeque (it's faster)
-    Stack<Integer> stack = new Stack<>();
-    Stack<Integer> minStack = new Stack<>(); // keeps track of minimums
+    Stack<Integer> stack = new Stack();
+    Stack<Integer> minStack = new Stack(); // keeps track of minimums
 
     // Always push onto stack. If it's a minimum, also push it onto minStack
     void push(int x) {

Chp. 03 - Stacks and Queues/_3_3_Stack_of_Plates/StackOfPlates.java

@@ -6,7 +6,7 @@
 import java.util.Stack; // can alternatively use ArrayDeque (it's faster)
 
 public class StackOfPlates {
-    private ArrayList<Stack<Integer>> stacks = new ArrayList<>();
+    private ArrayList<Stack<Integer>> stacks = new ArrayList();
     private int capacity = 3;
 
     /* Implemented to work like a standard push */
@@ -15,7 +15,7 @@ public void push(int data) {
         if (lastStack != null && lastStack.size() < capacity) {
             lastStack.push(data);
         } else {
-            Stack<Integer> anotherStack = new Stack<>(); // crucial step. Stacks aren't magically created 4 u.
+            Stack<Integer> anotherStack = new Stack(); // crucial step. Stacks aren't magically created 4 u.
             anotherStack.push(data);
             stacks.add(anotherStack);
         }

Chp. 03 - Stacks and Queues/_3_4_Queue_via_Stacks/QueueViaStacks.java

@@ -13,8 +13,8 @@
 import java.util.Stack;
 
 public class QueueViaStacks<T> {
-    private Stack<T> stack1 = new Stack<>();
-    private Stack<T> stack2 = new Stack<>();
+    private Stack<T> stack1 = new Stack();
+    private Stack<T> stack2 = new Stack();
 
     public int size() {
         return stack1.size() + stack2.size();

Chp. 03 - Stacks and Queues/_3_4_Queue_via_Stacks/Tester.java

@@ -6,7 +6,7 @@ public class Tester {
     public static void main(String[] args) {
         System.out.println("*** Test 3.4: Queue via Stacks\n");
         System.out.println("elements we will be inserting: 1, 2, 3, 4, 5\n");
-        QueueViaStacks<Integer> myQueue = new QueueViaStacks<>();
+        QueueViaStacks<Integer> myQueue = new QueueViaStacks();
         myQueue.add(1);
         myQueue.add(2);
         myQueue.add(3);

Chp. 03 - Stacks and Queues/_3_5_Sort_Stack/SortStack.java

@@ -6,7 +6,7 @@
 
 public class SortStack {
     public static Stack<Integer> sort(Stack<Integer> stack) {
-        Stack<Integer> helperStack = new Stack<>(); // can alternatively use ArrayDeque (it's faster)
+        Stack<Integer> helperStack = new Stack(); // can alternatively use ArrayDeque (it's faster)
         while (!stack.isEmpty()) {
             Integer curr = stack.pop(); // saving the top of the stack is one of the main tricks.
             while (!helperStack.isEmpty() && curr < helperStack.peek()) {

Chp. 03 - Stacks and Queues/_3_5_Sort_Stack/Tester.java

@@ -7,7 +7,7 @@
 public class Tester {
     public static void main(String[] args) {
         System.out.println("*** Test 3.6: Sort Stack\n");
-        Stack<Integer> stackToSort = new Stack<>();
+        Stack<Integer> stackToSort = new Stack();
         stackToSort.push(3);
         stackToSort.push(7);
         stackToSort.push(2);

Chp. 03 - Stacks and Queues/_3_6_Animal_Shelter/AnimalShelter.java

@@ -6,8 +6,8 @@
 
 public class AnimalShelter {
     int barcode = 0;
-    ArrayDeque<Cat> cats = new ArrayDeque<>();
-    ArrayDeque<Dog> dogs = new ArrayDeque<>();
+    ArrayDeque<Cat> cats = new ArrayDeque();
+    ArrayDeque<Dog> dogs = new ArrayDeque();
 
     public void enqueue(Animal animal) {
         animal.barcode = barcode++;

Chp. 04 - Trees and Graphs/_4_01_Route_Between_Nodes/RouteBetweenNodes.java

@@ -13,7 +13,7 @@ public static boolean routeExists(GraphNode start, GraphNode end) {
             return true;
         }
 
-        Deque<GraphNode> deque = new ArrayDeque<>(); // use deque as a queue
+        Deque<GraphNode> deque = new ArrayDeque(); // use deque as a queue
         start.visit();
         deque.add(start);
 

Chp. 04 - Trees and Graphs/_4_03_List_of_Depths/ListOfDepths.java

@@ -7,11 +7,11 @@
 
 public class ListOfDepths {
     public static List<List<Integer>> levelOrder(TreeNode root) {
-        List<List<Integer>> lists = new ArrayList<>();
+        List<List<Integer>> lists = new ArrayList();
         if (root == null) {
             return lists;
         }
-        ArrayDeque<TreeNode> deque = new ArrayDeque<>(); // use deque as a queue
+        ArrayDeque<TreeNode> deque = new ArrayDeque(); // use deque as a queue
         deque.add(root);
         while (!deque.isEmpty()) {
             int numNodesInLevel = deque.size();

Chp. 04 - Trees and Graphs/_4_07_Build_Order/BuildOrder.java

@@ -27,7 +27,7 @@ private static Deque<Node> topoSort(Graph graph) throws Exception {
             source.addDirectedNeighbor(node);
         }
 
-        Deque<Node> result = new ArrayDeque<>();
+        Deque<Node> result = new ArrayDeque();
         topoSortDFS(source, result);
         result.removeFirst(); // removes the source node we created
         return result;

Chp. 04 - Trees and Graphs/_4_07_Build_Order/Graph.java

@@ -5,8 +5,8 @@
 import java.util.*;
 
 public class Graph {
-    List<Node> nodes = new ArrayList<>();
-    Map<String, Node> map = new HashMap<>();
+    List<Node> nodes = new ArrayList();
+    Map<String, Node> map = new HashMap();
 
     public void addDirectedEdge(String s1, String s2) {
         Node source = map.get(s1);

Chp. 04 - Trees and Graphs/_4_07_Build_Order/Node.java

@@ -12,7 +12,7 @@ class Node {
     public Node(String data) {
         this.data = data;
         status = Visited.NEW;
-        neighbors = new ArrayList<>();
+        neighbors = new ArrayList();
     }
 
     public void addDirectedNeighbor(Node neighbor) {

Chp. 04 - Trees and Graphs/_4_09_BST_Sequences/BSTSequences.java

@@ -7,14 +7,14 @@
 
 public class BSTSequences {
     public static List<Deque<Integer>> allSequences(TreeNode node) {
-        List<Deque<Integer>> results = new ArrayList<>();
+        List<Deque<Integer>> results = new ArrayList();
 
         if (node == null) {
             results.add(new ArrayDeque<Integer>()); // crucial. So the code labeled "weave lists" works properly
             return results;
         }
 
-        Deque<Integer> prefix = new ArrayDeque<>();
+        Deque<Integer> prefix = new ArrayDeque();
         prefix.add(node.data);
 
         // Recursive Cases

Chp. 04 - Trees and Graphs/_4_11_Random_Node/BST.java

@@ -4,7 +4,7 @@
 
 class BST {
     Node root = null;
-    RandomizedCollection<Node> collection = new RandomizedCollection<>();
+    RandomizedCollection<Node> collection = new RandomizedCollection();
 
     public void insert(int value) {
         Node item = new Node(value);

Chp. 04 - Trees and Graphs/_4_11_Random_Node/RandomizedCollection.java

@@ -6,13 +6,13 @@
 
 public class RandomizedCollection<T> {
     Random rand = new Random();
-    List<T> list = new ArrayList<>();
-    Map<T, Set<Integer>> valToIndices = new HashMap<>();
+    List<T> list = new ArrayList();
+    Map<T, Set<Integer>> valToIndices = new HashMap();
 
     public void add(T item) {
         // update Map
         if (!valToIndices.containsKey(item)) {
-            valToIndices.put(item, new HashSet<>());
+            valToIndices.put(item, new HashSet());
         }
         valToIndices.get(item).add(list.size());
 

Chp. 04 - Trees and Graphs/_4_12_Paths_with_Sum/PathWithSums.java

@@ -8,7 +8,7 @@
 
 public class PathWithSums {
     public static int findSum(TreeNode node, int targetSum) {
-        Map<Integer, Integer> map = new HashMap<>();
+        Map<Integer, Integer> map = new HashMap();
         map.put(0, 1);
         return findSum(node, targetSum, 0, map);
     }

Chp. 07 - Object-Oriented Design/_7_01_Deck_of_Cards/Deck.java

@@ -23,7 +23,7 @@ public T dealCard() {
     }
 
     public LinkedList<T> dealHand(int numCards) {
-        LinkedList<T> cards = new LinkedList<>();
+        LinkedList<T> cards = new LinkedList();
         for (int i = 0; i < numCards; i++) {
             cards.add(deck.remove());
         }

Chp. 07 - Object-Oriented Design/_7_12_Hash_Table/Hash.java

@@ -20,7 +20,7 @@ public Hash() {
 
     private void initializeLists(ArrayList<LinkedList<Cell<K, V>>> lists) {
         for (int i = 0; i < numBuckets; i++) {
-            lists.add(new LinkedList<>());
+            lists.add(new LinkedList());
         }
     }
 

Chp. 07 - Object-Oriented Design/_7_12_Hash_Table/Main.java

@@ -4,7 +4,7 @@
 
 public class Main {
     public static void main(String[] args) {
-        Hash<Integer, String> map = new Hash<>();
+        Hash<Integer, String> map = new Hash();
         map.put(2, "Bob");
         System.out.print(map);
         System.out.println("Hash numBuckets = " + map.numBuckets + "\n");

Chp. 08 - Recursion and Dynamic Programming/_8_02_Robot_in_a_Grid/RobotInAGrid.java

@@ -22,11 +22,11 @@ public static List<Point> findPath(final boolean[][] maze, int row, int col) {
         }
 
         // Create path to save solution into 
-        List<Point> path = new ArrayList<>();
+        List<Point> path = new ArrayList();
         path.add(new Point(0, 0));
 
         // Create cache to save solutions to subproblems
-        Map<Point, Boolean> cache = new HashMap<>(); // requires overriding .equals() and .hashCode for Point, for HashMap to work properly
+        Map<Point, Boolean> cache = new HashMap(); // requires overriding .equals() and .hashCode for Point, for HashMap to work properly
         cache.put(new Point(0, 0), true); // base case
 
         // Recursively calculate answer
@@ -86,8 +86,8 @@ public static List<List<Point>> allPaths(boolean[][] maze, int row, int col) {
         if (maze == null || row >= maze.length || col >= maze[0].length) {
             return null;
         }
-        List<List<Point>> solutionPaths = new ArrayList<>();
-        getAllPaths(maze, 0, 0, solutionPaths, new ArrayList<>());
+        List<List<Point>> solutionPaths = new ArrayList();
+        getAllPaths(maze, 0, 0, solutionPaths, new ArrayList());
         return solutionPaths;
     }
 
@@ -109,7 +109,7 @@ public static void getAllPaths(boolean[][] maze, int row, int col, List<List<Poi
     }
 
     private static void deepCopyPathIntoSolutions(List<Point> path, List<List<Point>> solutionPaths) {
-        List<Point> solutionPath = new ArrayList<>();
+        List<Point> solutionPath = new ArrayList();
         for (int i = 0; i < path.size(); i++) {
             Point point = path.get(i);
             solutionPath.add(new Point(point.x, point.y));

Chp. 08 - Recursion and Dynamic Programming/_8_04_Power_Set/PowerSet.java

@@ -7,10 +7,10 @@
 public class PowerSet {
     public static List<List<Integer>> getSubsets(int[] array) {
         if (array == null || array.length == 0) {
-            return new ArrayList<>();
+            return new ArrayList();
         }
-        List<List<Integer>> solutions = new ArrayList<>();
-        makeSubsets(array, 0, solutions, new ArrayList<>());
+        List<List<Integer>> solutions = new ArrayList();
+        makeSubsets(array, 0, solutions, new ArrayList());
         return solutions;
     }
 

Chp. 08 - Recursion and Dynamic Programming/_8_06_Towers_of_Hanoi/Tower.java

@@ -10,7 +10,7 @@ class Tower {
     public int towerNum;
 
     public Tower(int towerNum) {
-        disks = new ArrayDeque<>();
+        disks = new ArrayDeque();
         this.towerNum = towerNum;
     }
 

Chp. 08 - Recursion and Dynamic Programming/_8_07_Permutations_without_Dups/PermutationsWithoutDups.java

@@ -7,10 +7,10 @@
 public class PermutationsWithoutDups {
     public static List<List<Integer>> permute(int[] array) {
         if (array == null || array.length == 0) {
-            return new ArrayList<>();
+            return new ArrayList();
         }
-        List<List<Integer>> solutions = new ArrayList<>();
-        permute(array, 0, new boolean[array.length], solutions, new ArrayList<>());
+        List<List<Integer>> solutions = new ArrayList();
+        permute(array, 0, new boolean[array.length], solutions, new ArrayList());
         return solutions;
     }
 

Chp. 08 - Recursion and Dynamic Programming/_8_08_Permutations_with_Dups/PermutationsWithDups.java

@@ -7,10 +7,10 @@
 public class PermutationsWithDups {
     public static List<List<Integer>> permute(int[] array) {
         if (array == null || array.length == 0) {
-            return new ArrayList<>();
+            return new ArrayList();
         }
-        Set<List<Integer>> solutions = new HashSet<>();
-        permute(array, 0, new boolean[array.length], solutions, new ArrayList<>());
+        Set<List<Integer>> solutions = new HashSet();
+        permute(array, 0, new boolean[array.length], solutions, new ArrayList());
         return new ArrayList<>(solutions);
     }
 

Chp. 08 - Recursion and Dynamic Programming/_8_09_Parens/Parens.java

@@ -6,7 +6,7 @@
 
 public class Parens {
     public static List<String> generateParentheses(int n) {
-        List<String> solutions = new ArrayList<>();
+        List<String> solutions = new ArrayList();
         addParenthesis(new char[n * 2], 0, n, n, solutions);
         return solutions;
     }

Chp. 08 - Recursion and Dynamic Programming/_8_12_Eight_Queens/EightQueens.java

@@ -10,11 +10,11 @@ public static List<List<String>> solveNQueens(int n) {
         for (char[] row : board) {
             Arrays.fill(row, '.');
         }
-        Set<Integer> cols = new HashSet<>(); // columns   |
-        Set<Integer> d1 = new HashSet<>();   // diagonals \
-        Set<Integer> d2 = new HashSet<>();   // diagonals /
+        Set<Integer> cols = new HashSet(); // columns   |
+        Set<Integer> d1 = new HashSet();   // diagonals \
+        Set<Integer> d2 = new HashSet();   // diagonals /
 
-        List<List<String>> solutions = new ArrayList<>();
+        List<List<String>> solutions = new ArrayList();
         placeQueens(board, n, solutions, 0, cols, d1, d2);
         return solutions;
     }
@@ -48,7 +48,7 @@ private static void placeQueens(char[][] board, int n, List<List<String>> soluti
     }
 
     private static List<String> makeSolutionBoard(char[][] board) {
-        List<String> solution = new ArrayList<>();
+        List<String> solution = new ArrayList();
         for (char[] row : board) {
             solution.add(new String(row));
         }

Chp. 08 - Recursion and Dynamic Programming/_8_13_Stack_of_Boxes/Tester.java

@@ -7,7 +7,7 @@
 public class Tester {
     public static void main(String[] args) {
         System.out.println("*** Test 8.13: Stack of Boxes\n");
-        List<Box> boxes = new LinkedList<>();
+        List<Box> boxes = new LinkedList();
         boxes.add(new Box(3, 4, 1));
         boxes.add(new Box(8, 6, 2));
         boxes.add(new Box(4, 8, 3));

Chp. 10 - Sorting and Searching/_10_02_Group_Anagrams/GroupAnagrams.java

@@ -12,7 +12,7 @@ public class GroupAnagrams {
     //   key:   the sorted version of the String.
     //   value: all the unsorted Strings that sort to the key.
     public static void groupAnagrams(String[] array) {
-        HashMap<String, List<String>> map = new HashMap<>();
+        HashMap<String, List<String>> map = new HashMap();
 
         // Group words by Anagram (by putting into HashMap)
         for (String str : array) {
@@ -45,7 +45,7 @@ private static String sortChars(String str) {
     //   Our key will represent the number of letters in each string, where each letter has a separator in it.
     //     -  Example: `aabccc` becomes `2-1-3-...0-` (where the `...` is for the remaining 22 characters)
     public static void groupAnagrams2(String[] array) {
-        HashMap<String, List<String>> map = new HashMap<>();
+        HashMap<String, List<String>> map = new HashMap();
 
         // Group words by Anagram (by putting into HashMap)
         for (String str : array) {

Chp. 16 - More Problems (Moderate)/_16_11_Diving_Board/DivingBoard.java

@@ -6,7 +6,7 @@
 
 public class DivingBoard {
     public static List<Integer> allLengths(int k, int shorter, int longer) {
-        List<Integer> lengths = new ArrayList<>();
+        List<Integer> lengths = new ArrayList();
         for (int numShorter = 0; numShorter <= k; numShorter++) {
             int numLonger = k - numShorter;
             int length = numShorter * shorter + numLonger * longer;