style: do not suppress try (#5167)

pom.xml

@@ -79,7 +79,6 @@
                         <arg>-Xlint:all</arg>
                         <arg>-Xlint:-auxiliaryclass</arg>
                         <arg>-Xlint:-rawtypes</arg>
-                        <arg>-Xlint:-try</arg>
                         <arg>-Xlint:-unchecked</arg>
                         <arg>-Xlint:-lossy-conversions</arg>
                         <arg>-Werror</arg>

src/main/java/com/thealgorithms/ciphers/ProductCipher.java

@@ -68,7 +68,6 @@ final class ProductCipher {
 
             System.out.println("Plaintext: ");
             System.out.println(plaintext);
-            sc.close();
         }
     }
 }

src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java

@@ -116,7 +116,6 @@ class BellmanFord /*
                     System.out.println();
                 }
             }
-            sc.close();
         }
     }
 

src/main/java/com/thealgorithms/datastructures/stacks/ReverseStack.java

@@ -22,7 +22,6 @@ public final class ReverseStack {
             for (i = 0; i < n; i++) {
                 stack.push(sc.nextInt());
             }
-            sc.close();
             reverseStack(stack);
             System.out.println("The reversed stack is:");
             while (!stack.isEmpty()) {

src/main/java/com/thealgorithms/maths/NonRepeatingElement.java

@@ -30,12 +30,6 @@ public final class NonRepeatingElement {
                 arr[i] = sc.nextInt();
             }
 
-            try {
-                sc.close();
-            } catch (Exception e) {
-                System.out.println("Unable to close scanner" + e);
-            }
-
             // Find XOR of the 2 non repeating elements
             for (i = 0; i < n; i++) {
                 res ^= arr[i];
@@ -55,7 +49,6 @@ public final class NonRepeatingElement {
             }
 
             System.out.println("The two non repeating elements are " + num1 + " and " + num2);
-            sc.close();
         }
     }
     /*

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

@@ -47,7 +47,6 @@ public final class InsertDeleteInArray {
             for (i = 0; i < size2 - 1; i++) {
                 System.out.println(b[i]);
             }
-            s.close();
         }
     }
 }

src/main/java/com/thealgorithms/sorts/LinkListSort.java

@@ -8,13 +8,10 @@
 package com.thealgorithms.sorts;
 
 import java.util.Arrays;
-import java.util.Scanner;
 
 public class LinkListSort {
 
     public static boolean isSorted(int[] p, int option) {
-        try (Scanner sc = new Scanner(System.in)) {
-        }
         int[] a = p;
         // Array is taken as input from test class
         int[] b = p;