Merge pull request TheAlgorithms#1217 from Hassan-Elseoudy/master

nikhilkala · web-flow · commit 926ed2e10a98 · 2020-01-28T22:11:19.000+05:30
Closing scanners.
diff --git a/Conversions/AnyBaseToAnyBase.java b/Conversions/AnyBaseToAnyBase.java
@@ -52,6 +52,7 @@ public static void main(String[] args) {
             }
         }
         System.out.println(base2base(n, b1, b2));
+        in.close();
     }
 
     /**
diff --git a/Conversions/AnytoAny.java b/Conversions/AnytoAny.java
@@ -24,6 +24,7 @@ public static void main(String[] args) {
             dec /= db;
         }
         System.out.println(dn);
+        scn.close();
     }
 
 }
diff --git a/Conversions/DecimalToBinary.java b/Conversions/DecimalToBinary.java
@@ -53,6 +53,7 @@ public static void bitwiseConversion() {
             n >>= 1;
         }
         System.out.println("\tBinary number: " + b);
+        input.close();
     }
 
 }
diff --git a/Conversions/HexToOct.java b/Conversions/HexToOct.java
@@ -64,7 +64,6 @@ public static void main(String args[]) {
         // convert decimal to octal
         octalnum = decimal2octal(decnum);
         System.out.println("Number in octal: " + octalnum);
-
-
+        scan.close();
     }
 }
diff --git a/Conversions/HexaDecimalToDecimal.java b/Conversions/HexaDecimalToDecimal.java
@@ -34,7 +34,7 @@ public static void main(String args[]) {
         and it returns the decimal form in the variable dec_output.
         */
         System.out.println("Number in Decimal: " + dec_output);
-
+        scan.close();
 
     }
 }
diff --git a/Conversions/OctalToHexadecimal.java b/Conversions/OctalToHexadecimal.java
@@ -59,6 +59,7 @@ public static void main(String args[]) {
         // Pass the decimla number to function and get converted Hex form of the number
         String hex = DecimalToHex(decimal);
         System.out.println("The Hexadecimal equivalant is: " + hex);
+        input.close();
     }
 }
 
diff --git a/DataStructures/Graphs/BellmanFord.java b/DataStructures/Graphs/BellmanFord.java
@@ -100,6 +100,7 @@ public void go()//Interactive run for understanding the class first time. Assume
                 System.out.println();
             }
         }
+        sc.close();
     }
     /**
      * @param source Starting vertex
diff --git a/DataStructures/HashMap/Hashing/Main.java b/DataStructures/HashMap/Hashing/Main.java
@@ -42,6 +42,7 @@ public static void main(String[] args) {
 					return;
 				}	
 			}
+			In.close();
 		}
 	}
 }
diff --git a/DataStructures/Trees/RedBlackBST.java b/DataStructures/Trees/RedBlackBST.java
@@ -309,6 +309,7 @@ public void insertDemo() {
             printTreepre(root);
             break;
         }
+        scan.close();
     }
 
     public void deleteDemo() {
diff --git a/DynamicProgramming/EditDistance.java b/DynamicProgramming/EditDistance.java
@@ -74,5 +74,6 @@ public static void main(String[] args) {
         //ans stores the final Edit Distance between the two strings
         int ans = minDistance(s1, s2);
         System.out.println("The minimum Edit Distance between \"" + s1 + "\" and \"" + s2 + "\" is " + ans);
+        input.close();
     }
 }
diff --git a/DynamicProgramming/Fibonacci.java b/DynamicProgramming/Fibonacci.java
@@ -22,6 +22,7 @@ public static void main(String[] args) {
         System.out.println(fibMemo(n));
         System.out.println(fibBotUp(n));
         System.out.println(fibOptimized(n));
+        sc.close();
     }
 
     /**
diff --git a/DynamicProgramming/LongestIncreasingSubsequence.java b/DynamicProgramming/LongestIncreasingSubsequence.java
@@ -17,6 +17,7 @@ public static void main(String[] args) {
         }
 
         System.out.println(LIS(ar));
+        sc.close();
     }
 
     private static int upperBound(int[] ar, int l, int r, int key) {
diff --git a/Maths/PrimeCheck.java b/Maths/PrimeCheck.java
@@ -13,6 +13,7 @@ public static void main(String[] args) {
         } else {
             System.out.println(n + " is not a prime number");
         }
+        scanner.close();
     }
 
     /***
diff --git a/MinimizingLateness/MinimizingLateness.java b/MinimizingLateness/MinimizingLateness.java
@@ -53,5 +53,6 @@ public static void main(String[] args) throws IOException {
         System.out.println();
         System.out.println("Output Data : ");
         System.out.println(lateness);
+        in.close();
     }
 }
diff --git a/Misc/PalindromePrime.java b/Misc/PalindromePrime.java
@@ -9,6 +9,7 @@ public static void main(String[] args) { // Main funtion
         System.out.println("Enter the quantity of First Palindromic Primes you want");
         int n = in.nextInt(); // Input of how many first pallindromic prime we want
         functioning(n); // calling function - functioning  
+        in.close();
     }
 
     public static boolean prime(int num) { // checking if number is prime or not
diff --git a/Others/Dijkshtra.java b/Others/Dijkshtra.java
@@ -80,5 +80,6 @@ else if (i != src) {
                 System.out.print("-1" + " ");
             }
         }
+        in.close();
     }
 }
diff --git a/Others/InsertDeleteInArray.java b/Others/InsertDeleteInArray.java
@@ -44,5 +44,6 @@ public static void main(String[] args) {
         }
         for (i = 0; i < size2 - 1; i++)
             System.out.println(b[i]);
+        s.close();
     }
 }
diff --git a/Others/LowestBasePalindrome.java b/Others/LowestBasePalindrome.java
@@ -29,6 +29,7 @@ public static void main(String[] args) {
         }
         System.out.println(n + " is a palindrome in base " + lowestBasePalindrome(n));
         System.out.println(base2base(Integer.toString(n), 10, lowestBasePalindrome(n)));
+        in.close();
     }
 
     /**
diff --git a/Others/PerlinNoise.java b/Others/PerlinNoise.java
@@ -162,5 +162,6 @@ public static void main(String[] args) {
 
             System.out.println();
         }
+        in.close();
     }
 }
diff --git a/Others/PowerOfTwoOrNot.java b/Others/PowerOfTwoOrNot.java
@@ -20,6 +20,7 @@ public static void main(String[] args) {
         } else {
             System.out.println("Number is not a power of two");
         }
+        sc.close();
     }
 
 
@@ -32,5 +33,4 @@ public static void main(String[] args) {
     public static boolean checkIfPowerOfTwoOrNot(int number) {
         return number != 0 && ((number & (number - 1)) == 0);
     }
-
 }
diff --git a/Others/ReturnSubsequence.java b/Others/ReturnSubsequence.java
@@ -13,6 +13,7 @@ public static void main(String[] args) {
         for (int i = 0; i < subsequence.length; i++) {
             System.out.println(subsequence[i]);
         }
+        s.close();
     }
 
     /**
diff --git a/Others/RootPrecision.java b/Others/RootPrecision.java
@@ -14,6 +14,8 @@ public static void main(String[] args) {
         // P is precision value for eg - P is 3 in 2.564 and 5 in 3.80870.
         int P = scn.nextInt();
         System.out.println(squareRoot(N, P));
+
+        scn.close();
     }
 
     public static double squareRoot(int N, int P) {
diff --git a/Others/SJF.java b/Others/SJF.java
@@ -67,6 +67,7 @@ class Schedule {
             processes.add(p);
             burstAll += p.burstTime;
         }
+        in.close();
 
     }
 
diff --git a/Others/StackPostfixNotation.java b/Others/StackPostfixNotation.java
@@ -7,6 +7,7 @@ public static void main(String[] args) {
         Scanner scanner = new Scanner(System.in);
         String post = scanner.nextLine();   // Takes input with spaces in between eg. "1 21 +"
         System.out.println(postfixEvaluate(post));
+        scanner.close();
     }
 
     // Evaluates the given postfix expression string and returns the result.
@@ -35,6 +36,7 @@ public static int postfixEvaluate(String exp) {
                 //  "+", "-", "*", "/"
             }
         }
+        tokens.close();
         return s.pop();
     }
 }
diff --git a/Others/TopKWords.java b/Others/TopKWords.java
@@ -82,6 +82,7 @@ public static void main(String[] args) {
         for (int i = 0; i < k; i++) {
             System.out.println(list.get(list.size() - i - 1));
         }
+        input.close();
     }
 }
 
diff --git a/Others/TowerOfHanoi.java b/Others/TowerOfHanoi.java
@@ -22,5 +22,6 @@ public static void main(String[] args) {
         Scanner scanner = new Scanner(System.in);
         int numberOfDiscs = scanner.nextInt(); //input of number of discs on pole 1
         shift(numberOfDiscs, "Pole1", "Pole2", "Pole3"); //Shift function called
+        scanner.close();
     }
 }
diff --git a/ciphers/Caesar.java b/ciphers/Caesar.java
@@ -126,6 +126,7 @@ public static void main(String[] args) {
             case 'd':
                 System.out.println("DECODED MESSAGE IS \n" + decode(message, shift));
         }
+        input.close();
     }
 
 }

Original file line number	Diff line number	Diff line change
`@@ -52,6 +52,7 @@ public static void main(String[] args) {`
`52`	`52`	`}`
`53`	`53`	`}`
`54`	`54`	`System.out.println(base2base(n, b1, b2));`
	`55`	`+ in.close();`
`55`	`56`	`}`
`56`	`57`
`57`	`58`	`/**`
Original file line number	Diff line number	Diff line change
`@@ -24,6 +24,7 @@ public static void main(String[] args) {`
`24`	`24`	`dec /= db;`
`25`	`25`	`}`
`26`	`26`	`System.out.println(dn);`
	`27`	`+ scn.close();`
`27`	`28`	`}`
`28`	`29`
`29`	`30`	`}`
Original file line number	Diff line number	Diff line change
`@@ -53,6 +53,7 @@ public static void bitwiseConversion() {`
`53`	`53`	`n >>= 1;`
`54`	`54`	`}`
`55`	`55`	`System.out.println("\tBinary number: " + b);`
	`56`	`+ input.close();`
`56`	`57`	`}`
`57`	`58`
`58`	`59`	`}`
Original file line number	Diff line number	Diff line change
`@@ -64,7 +64,6 @@ public static void main(String args[]) {`
`64`	`64`	`// convert decimal to octal`
`65`	`65`	`octalnum = decimal2octal(decnum);`
`66`	`66`	`System.out.println("Number in octal: " + octalnum);`
`67`		`-`
`68`		`-`
	`67`	`+ scan.close();`
`69`	`68`	`}`
`70`	`69`	`}`
Original file line number	Diff line number	Diff line change
`@@ -34,7 +34,7 @@ public static void main(String args[]) {`
`34`	`34`	`and it returns the decimal form in the variable dec_output.`
`35`	`35`	`*/`
`36`	`36`	`System.out.println("Number in Decimal: " + dec_output);`
`37`		`-`
	`37`	`+ scan.close();`
`38`	`38`
`39`	`39`	`}`
`40`	`40`	`}`
Original file line number	Diff line number	Diff line change
`@@ -59,6 +59,7 @@ public static void main(String args[]) {`
`59`	`59`	`// Pass the decimla number to function and get converted Hex form of the number`
`60`	`60`	`String hex = DecimalToHex(decimal);`
`61`	`61`	`System.out.println("The Hexadecimal equivalant is: " + hex);`
	`62`	`+ input.close();`
`62`	`63`	`}`
`63`	`64`	`}`
`64`	`65`
Original file line number	Diff line number	Diff line change
`@@ -100,6 +100,7 @@ public void go()//Interactive run for understanding the class first time. Assume`
`100`	`100`	`System.out.println();`
`101`	`101`	`}`
`102`	`102`	`}`
	`103`	`+ sc.close();`
`103`	`104`	`}`
`104`	`105`	`/**`
`105`	`106`	`* @param source Starting vertex`
Original file line number	Diff line number	Diff line change
`@@ -42,6 +42,7 @@ public static void main(String[] args) {`
`42`	`42`	`return;`
`43`	`43`	`}`
`44`	`44`	`}`
	`45`	`+ In.close();`
`45`	`46`	`}`
`46`	`47`	`}`
`47`	`48`	`}`
Original file line number	Diff line number	Diff line change
`@@ -309,6 +309,7 @@ public void insertDemo() {`
`309`	`309`	`printTreepre(root);`
`310`	`310`	`break;`
`311`	`311`	`}`
	`312`	`+ scan.close();`
`312`	`313`	`}`
`313`	`314`
`314`	`315`	`public void deleteDemo() {`
Original file line number	Diff line number	Diff line change
`@@ -74,5 +74,6 @@ public static void main(String[] args) {`
`74`	`74`	`//ans stores the final Edit Distance between the two strings`
`75`	`75`	`int ans = minDistance(s1, s2);`
`76`	`76`	`System.out.println("The minimum Edit Distance between \"" + s1 + "\" and \"" + s2 + "\" is " + ans);`
	`77`	`+ input.close();`
`77`	`78`	`}`
`78`	`79`	`}`