Merge pull request #26 from code4tomorrow/fix-imports

Author: JJ27

src/com/codefortomorrow/advanced/chapter14/practice/Average.java

@@ -1,7 +1,5 @@
 package com.codefortomorrow.advanced.chapter14.practice;
 
-import java.io.*;
-
 /*
 The file “numbers.txt” has 100 random numbers
 (one on each line). Use file i/o to find the

src/com/codefortomorrow/advanced/chapter14/practice/Lexico.java

@@ -1,7 +1,5 @@
 package com.codefortomorrow.advanced.chapter14.practice;
 
-import java.io.*;
-
 /*
 Practice: Use File I/O to compare two files lexicographically.
 Lexicographical order is very similar to alphabetical order,

src/com/codefortomorrow/advanced/chapter16/solutions/Access.java

@@ -1,6 +1,7 @@
 package com.codefortomorrow.advanced.chapter16.solutions;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.LinkedList;
 
 /*
 Using the methods outlined in the “Benefits of LinkedLists” section,
@@ -15,6 +16,7 @@
 
 public class Access {
 
+    @SuppressWarnings("unused")
     public static void main(String[] args) {
         long a, b;
 

src/com/codefortomorrow/advanced/chapter16/solutions/Names.java

@@ -1,6 +1,7 @@
 package com.codefortomorrow.advanced.chapter16.solutions;
 
-import java.util.*;
+import java.util.LinkedList;
+import java.util.Scanner;
 
 /*
 Create a LinkedList of Strings, and ask the user to
@@ -38,5 +39,7 @@ public static void main(String[] args) {
         list.add(0, "Apple");
         list.add(list.size() - 1, "Peanut");
         System.out.println(list);
+
+        sc.close();
     }
 }

src/com/codefortomorrow/advanced/chapter16/solutions/Sort.java

@@ -1,6 +1,7 @@
 package com.codefortomorrow.advanced.chapter16.solutions;
 
-import java.util.*;
+import java.util.Arrays;
+import java.util.LinkedList;
 
 /*
 Write a method which takes in a LinkedList of Strings