style: do not suppress try (TheAlgorithms#5167)

vil02 · web-flow · commit ea4dc15a249e · 2024-05-27T03:02:36.000+05:30
diff --git a/pom.xml b/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>
diff --git a/src/main/java/com/thealgorithms/ciphers/ProductCipher.java b/src/main/java/com/thealgorithms/ciphers/ProductCipher.java
@@ -68,7 +68,6 @@ public static void main(String[] args) {
 
             System.out.println("Plaintext: ");
             System.out.println(plaintext);
-            sc.close();
         }
     }
 }
diff --git a/src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java b/src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java
@@ -116,7 +116,6 @@ public void go() { // shows distance to all vertices // Interactive run for unde
                     System.out.println();
                 }
             }
-            sc.close();
         }
     }
 
diff --git a/src/main/java/com/thealgorithms/datastructures/stacks/ReverseStack.java b/src/main/java/com/thealgorithms/datastructures/stacks/ReverseStack.java
@@ -22,7 +22,6 @@ public static void main(String[] args) {
             for (i = 0; i < n; i++) {
                 stack.push(sc.nextInt());
             }
-            sc.close();
             reverseStack(stack);
             System.out.println("The reversed stack is:");
             while (!stack.isEmpty()) {
diff --git a/src/main/java/com/thealgorithms/maths/NonRepeatingElement.java b/src/main/java/com/thealgorithms/maths/NonRepeatingElement.java
@@ -30,12 +30,6 @@ public static void main(String[] args) {
                 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 static void main(String[] args) {
             }
 
             System.out.println("The two non repeating elements are " + num1 + " and " + num2);
-            sc.close();
         }
     }
     /*
diff --git a/src/main/java/com/thealgorithms/others/InsertDeleteInArray.java b/src/main/java/com/thealgorithms/others/InsertDeleteInArray.java
@@ -47,7 +47,6 @@ public static void main(String[] args) {
             for (i = 0; i < size2 - 1; i++) {
                 System.out.println(b[i]);
             }
-            s.close();
         }
     }
 }
diff --git a/src/main/java/com/thealgorithms/sorts/LinkListSort.java b/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;

Original file line number	Diff line number	Diff line change
`@@ -68,7 +68,6 @@ public static void main(String[] args) {`
`68`	`68`
`69`	`69`	`System.out.println("Plaintext: ");`
`70`	`70`	`System.out.println(plaintext);`
`71`		`- sc.close();`
`72`	`71`	`}`
`73`	`72`	`}`
`74`	`73`	`}`
Original file line number	Diff line number	Diff line change
`@@ -116,7 +116,6 @@ public void go() { // shows distance to all vertices // Interactive run for unde`
`116`	`116`	`System.out.println();`
`117`	`117`	`}`
`118`	`118`	`}`
`119`		`- sc.close();`
`120`	`119`	`}`
`121`	`120`	`}`
`122`	`121`
Original file line number	Diff line number	Diff line change
`@@ -22,7 +22,6 @@ public static void main(String[] args) {`
`22`	`22`	`for (i = 0; i < n; i++) {`
`23`	`23`	`stack.push(sc.nextInt());`
`24`	`24`	`}`
`25`		`- sc.close();`
`26`	`25`	`reverseStack(stack);`
`27`	`26`	`System.out.println("The reversed stack is:");`
`28`	`27`	`while (!stack.isEmpty()) {`
Original file line number	Diff line number	Diff line change
`@@ -30,12 +30,6 @@ public static void main(String[] args) {`
`30`	`30`	`arr[i] = sc.nextInt();`
`31`	`31`	`}`
`32`	`32`
`33`		`- try {`
`34`		`- sc.close();`
`35`		`- } catch (Exception e) {`
`36`		`- System.out.println("Unable to close scanner" + e);`
`37`		`- }`
`38`		`-`
`39`	`33`	`// Find XOR of the 2 non repeating elements`
`40`	`34`	`for (i = 0; i < n; i++) {`
`41`	`35`	`res ^= arr[i];`
`@@ -55,7 +49,6 @@ public static void main(String[] args) {`
`55`	`49`	`}`
`56`	`50`
`57`	`51`	`System.out.println("The two non repeating elements are " + num1 + " and " + num2);`
`58`		`- sc.close();`
`59`	`52`	`}`
`60`	`53`	`}`
`61`	`54`	`/*`
Original file line number	Diff line number	Diff line change
`@@ -47,7 +47,6 @@ public static void main(String[] args) {`
`47`	`47`	`for (i = 0; i < size2 - 1; i++) {`
`48`	`48`	`System.out.println(b[i]);`
`49`	`49`	`}`
`50`		`- s.close();`
`51`	`50`	`}`
`52`	`51`	`}`
`53`	`52`	`}`