enable AvoidStarImport check

Author: fishercoder1534

fishercoder_checkstyle.xml

@@ -58,7 +58,7 @@
             <property name="max" value="1000000"/>
             <property name="ignorePattern" value="^package.*|^import.*|a href|href|http://|https://|ftp://"/>
         </module>
-        <!-- <module name="AvoidStarImport"/> -->
+        <module name="AvoidStarImport"/>
         <module name="OneTopLevelClass"/>
         <!--<module name="NoLineWrap"/>-->
         <module name="EmptyBlock">

src/main/java/com/fishercoder/common/utils/TreeUtils.java

@@ -2,7 +2,13 @@
 
 import com.fishercoder.common.classes.TreeNode;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Queue;
+
 
 /**
  * This is a util class to contain all tree related methods.
@@ -71,7 +77,7 @@ private static void printNodeInternal(
 
 		CommonUtils.printWhitespaces(firstSpaces);
 
-		List<TreeNode> newNodes = new ArrayList<TreeNode>();
+		List<TreeNode> newNodes = new ArrayList<>();
 		for (TreeNode node : list) {
 			if (node != null) {
 				System.out.print(node.val);

src/main/java/com/fishercoder/solutions/_103.java

@@ -2,7 +2,12 @@
 
 import com.fishercoder.common.classes.TreeNode;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Queue;
+
 
 /**
  * 103. Binary Tree Zigzag Level Order Traversal  

src/main/java/com/fishercoder/solutions/_107.java

@@ -2,7 +2,12 @@
 
 import com.fishercoder.common.classes.TreeNode;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Queue;
+
 
 /**107. Binary Tree Level Order Traversal II
 
@@ -28,10 +33,10 @@
 
 public class _107 {
 	public List<List<Integer>> levelOrder(TreeNode root) {
-		List<List<Integer>> result = new ArrayList<List<Integer>>();
+		List<List<Integer>> result = new ArrayList();
 		if(root == null) return result;
 
-		Queue<TreeNode> q = new LinkedList<TreeNode>();
+		Queue<TreeNode> q = new LinkedList();
 		q.offer(root);
 		while(!q.isEmpty()){
 			List<Integer> thisLevel = new ArrayList<Integer>();

src/main/java/com/fishercoder/solutions/_118.java

@@ -1,6 +1,8 @@
 package com.fishercoder.solutions;
 
-import java.util.*;
+
+import java.util.ArrayList;
+import java.util.List;
 
 /**
  * 118. Pascal's Triangle

src/main/java/com/fishercoder/solutions/_119.java

@@ -1,6 +1,8 @@
 package com.fishercoder.solutions;
 
-import java.util.*;
+
+import java.util.ArrayList;
+import java.util.List;
 
 /**
  * 119. Pascal's Triangle II

src/main/java/com/fishercoder/solutions/_120.java

@@ -1,6 +1,8 @@
 package com.fishercoder.solutions;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
 
 /**Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
 

src/main/java/com/fishercoder/solutions/_126.java

@@ -1,6 +1,13 @@
 package com.fishercoder.solutions;
 
-import java.util.*;
+
+import java.util.ArrayDeque;
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Map;
+import java.util.Queue;
 
 /**
  * 126. Word Ladder II
@@ -81,7 +88,7 @@ public List<List<String>> findLadders(String start, String end, List<String> dic
                         if (map.containsKey(newWord)) {//Build adjacent Graph
                             map.get(newWord).add(word);
                         } else {
-                            List<String> list = new LinkedList<String>();
+                            List<String> list = new LinkedList();
                             list.add(word);
                             map.put(newWord, list);
                             //It is possible to write three lines in one:

src/main/java/com/fishercoder/solutions/_128.java

@@ -1,6 +1,10 @@
 package com.fishercoder.solutions;
 
-import java.util.*;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.Map;
+import java.util.Set;
+
 /**
  * Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
 

src/main/java/com/fishercoder/solutions/_130.java

@@ -1,6 +1,7 @@
 package com.fishercoder.solutions;
 
-import java.util.*;
+import java.util.LinkedList;
+import java.util.Queue;
 
 /**
  * 130. Surrounded Regions