Code cleanup (#4246)

src/main/java/com/thealgorithms/others/BoyerMoore.java

@@ -44,5 +44,6 @@ public class BoyerMoore {
             a[i] = input.nextInt();
         }
         System.out.println("the majority element is " + findmajor(a));
+        input.close();
     }
 }

src/main/java/com/thealgorithms/others/CountWords.java

@@ -1,7 +1,5 @@
 package com.thealgorithms.others;
 
-import java.util.Scanner;
-
 /**
  * @author Marcus
  */

src/main/java/com/thealgorithms/others/HappyNumbersSeq.java

@@ -19,6 +19,7 @@ public class HappyNumbersSeq {
         }
         String res = n == 1 ? "1 Happy number" : "Sad number";
         System.out.println(res);
+        in.close();
     }
 
     private static int sumSquares(int n) {

src/main/java/com/thealgorithms/others/Huffman.java

@@ -118,5 +118,6 @@ public class Huffman {
 
         // print the codes by traversing the tree
         printCode(root, "");
+        s.close();
     }
 }

src/main/java/com/thealgorithms/others/RotateMatriceBy90Degree.java

@@ -22,8 +22,7 @@ class Rotate_by_90_degree {
                 }
             }
 
-            Rotate g = new Rotate();
-            g.rotate(arr);
+            Rotate.rotate(arr);
             printMatrix(arr);
         }
         sc.close();

src/main/java/com/thealgorithms/others/cn/HammingDistance.java

@@ -1,8 +1,5 @@
 package com.thealgorithms.others.cn;
 
-import java.util.ArrayList;
-import java.util.List;
-
 final public class HammingDistance {
     private HammingDistance() {
     }