From a1f59c38b1054ced1325ece802d94c243444e055 Mon Sep 17 00:00:00 2001 From: Hassan Date: Tue, 28 Jan 2020 18:34:52 +0200 Subject: [PATCH] Closing scanners. --- Conversions/AnyBaseToAnyBase.java | 1 + Conversions/AnytoAny.java | 1 + Conversions/DecimalToBinary.java | 1 + Conversions/HexToOct.java | 3 +-- Conversions/HexaDecimalToDecimal.java | 2 +- Conversions/OctalToHexadecimal.java | 1 + DataStructures/Graphs/BellmanFord.java | 1 + DataStructures/HashMap/Hashing/Main.java | 1 + DataStructures/Trees/RedBlackBST.java | 1 + DynamicProgramming/EditDistance.java | 1 + DynamicProgramming/Fibonacci.java | 1 + DynamicProgramming/LongestIncreasingSubsequence.java | 1 + Maths/PrimeCheck.java | 1 + MinimizingLateness/MinimizingLateness.java | 1 + Misc/PalindromePrime.java | 1 + Others/Dijkshtra.java | 1 + Others/InsertDeleteInArray.java | 1 + Others/LowestBasePalindrome.java | 1 + Others/PerlinNoise.java | 1 + Others/PowerOfTwoOrNot.java | 2 +- Others/ReturnSubsequence.java | 1 + Others/RootPrecision.java | 2 ++ Others/SJF.java | 1 + Others/StackPostfixNotation.java | 2 ++ Others/TopKWords.java | 1 + Others/TowerOfHanoi.java | 1 + ciphers/Caesar.java | 1 + 27 files changed, 29 insertions(+), 4 deletions(-) diff --git a/Conversions/AnyBaseToAnyBase.java b/Conversions/AnyBaseToAnyBase.java index cfcf0fe9a..2cef99260 100644 --- a/Conversions/AnyBaseToAnyBase.java +++ b/Conversions/AnyBaseToAnyBase.java @@ -52,6 +52,7 @@ public class AnyBaseToAnyBase { } } System.out.println(base2base(n, b1, b2)); + in.close(); } /** diff --git a/Conversions/AnytoAny.java b/Conversions/AnytoAny.java index 5fc744a99..1bc115404 100644 --- a/Conversions/AnytoAny.java +++ b/Conversions/AnytoAny.java @@ -24,6 +24,7 @@ public class AnytoAny { dec /= db; } System.out.println(dn); + scn.close(); } } diff --git a/Conversions/DecimalToBinary.java b/Conversions/DecimalToBinary.java index c709d0d16..cd84486ae 100644 --- a/Conversions/DecimalToBinary.java +++ b/Conversions/DecimalToBinary.java @@ -53,6 +53,7 @@ class DecimalToBinary { n >>= 1; } System.out.println("\tBinary number: " + b); + input.close(); } } diff --git a/Conversions/HexToOct.java b/Conversions/HexToOct.java index a46debfe9..2807735f7 100644 --- a/Conversions/HexToOct.java +++ b/Conversions/HexToOct.java @@ -64,7 +64,6 @@ public class HexToOct { // 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 index 533009b8a..14b0d94d7 100644 --- a/Conversions/HexaDecimalToDecimal.java +++ b/Conversions/HexaDecimalToDecimal.java @@ -34,7 +34,7 @@ public class HexaDecimalToDecimal { 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 index 2cefc9200..dd8d87710 100644 --- a/Conversions/OctalToHexadecimal.java +++ b/Conversions/OctalToHexadecimal.java @@ -59,6 +59,7 @@ public class OctalToHexadecimal { // 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 index 61785acec..6dffede9e 100644 --- a/DataStructures/Graphs/BellmanFord.java +++ b/DataStructures/Graphs/BellmanFord.java @@ -100,6 +100,7 @@ start vertex, end vertes and weights. Vertices should be labelled with a number System.out.println(); } } + sc.close(); } /** * @param source Starting vertex diff --git a/DataStructures/HashMap/Hashing/Main.java b/DataStructures/HashMap/Hashing/Main.java index 66f65c1d9..340f0760b 100644 --- a/DataStructures/HashMap/Hashing/Main.java +++ b/DataStructures/HashMap/Hashing/Main.java @@ -42,6 +42,7 @@ public class Main { return; } } + In.close(); } } } \ No newline at end of file diff --git a/DataStructures/Trees/RedBlackBST.java b/DataStructures/Trees/RedBlackBST.java index 97a88e9a4..197c96321 100644 --- a/DataStructures/Trees/RedBlackBST.java +++ b/DataStructures/Trees/RedBlackBST.java @@ -309,6 +309,7 @@ public class RedBlackBST { printTreepre(root); break; } + scan.close(); } public void deleteDemo() { diff --git a/DynamicProgramming/EditDistance.java b/DynamicProgramming/EditDistance.java index 210469b84..20cb8803a 100644 --- a/DynamicProgramming/EditDistance.java +++ b/DynamicProgramming/EditDistance.java @@ -74,5 +74,6 @@ public class EditDistance { //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 index 112a014a3..89be0836f 100644 --- a/DynamicProgramming/Fibonacci.java +++ b/DynamicProgramming/Fibonacci.java @@ -22,6 +22,7 @@ public class Fibonacci { 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 index 2b07e040d..c82965185 100644 --- a/DynamicProgramming/LongestIncreasingSubsequence.java +++ b/DynamicProgramming/LongestIncreasingSubsequence.java @@ -17,6 +17,7 @@ public class LongestIncreasingSubsequence { } 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 index 3093894a3..c972aa8c3 100644 --- a/Maths/PrimeCheck.java +++ b/Maths/PrimeCheck.java @@ -13,6 +13,7 @@ public class PrimeCheck { } else { System.out.println(n + " is not a prime number"); } + scanner.close(); } /*** diff --git a/MinimizingLateness/MinimizingLateness.java b/MinimizingLateness/MinimizingLateness.java index e5f71e9ef..1438f6f3d 100644 --- a/MinimizingLateness/MinimizingLateness.java +++ b/MinimizingLateness/MinimizingLateness.java @@ -53,5 +53,6 @@ public class MinimizingLateness { System.out.println(); System.out.println("Output Data : "); System.out.println(lateness); + in.close(); } } diff --git a/Misc/PalindromePrime.java b/Misc/PalindromePrime.java index b13a23d83..77a918c32 100644 --- a/Misc/PalindromePrime.java +++ b/Misc/PalindromePrime.java @@ -9,6 +9,7 @@ public class PalindromePrime { 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 index c2b1558e8..d964d0596 100644 --- a/Others/Dijkshtra.java +++ b/Others/Dijkshtra.java @@ -80,5 +80,6 @@ public class Dijkshtra { System.out.print("-1" + " "); } } + in.close(); } } \ No newline at end of file diff --git a/Others/InsertDeleteInArray.java b/Others/InsertDeleteInArray.java index 40fd43b2e..dfb702847 100644 --- a/Others/InsertDeleteInArray.java +++ b/Others/InsertDeleteInArray.java @@ -44,5 +44,6 @@ public class InsertDeleteInArray { } for (i = 0; i < size2 - 1; i++) System.out.println(b[i]); + s.close(); } } diff --git a/Others/LowestBasePalindrome.java b/Others/LowestBasePalindrome.java index 97b445b2f..2f8831100 100644 --- a/Others/LowestBasePalindrome.java +++ b/Others/LowestBasePalindrome.java @@ -29,6 +29,7 @@ public class LowestBasePalindrome { } 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 index dbd0a86e4..f0e7f63da 100644 --- a/Others/PerlinNoise.java +++ b/Others/PerlinNoise.java @@ -162,5 +162,6 @@ public class PerlinNoise { System.out.println(); } + in.close(); } } diff --git a/Others/PowerOfTwoOrNot.java b/Others/PowerOfTwoOrNot.java index 349eb9de5..8f0400133 100644 --- a/Others/PowerOfTwoOrNot.java +++ b/Others/PowerOfTwoOrNot.java @@ -20,6 +20,7 @@ public class PowerOfTwoOrNot { } else { System.out.println("Number is not a power of two"); } + sc.close(); } @@ -32,5 +33,4 @@ public class PowerOfTwoOrNot { public static boolean checkIfPowerOfTwoOrNot(int number) { return number != 0 && ((number & (number - 1)) == 0); } - } diff --git a/Others/ReturnSubsequence.java b/Others/ReturnSubsequence.java index bb1b413af..89e945f82 100644 --- a/Others/ReturnSubsequence.java +++ b/Others/ReturnSubsequence.java @@ -13,6 +13,7 @@ public class ReturnSubsequence { 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 index 388f1b2ec..71690a4b2 100644 --- a/Others/RootPrecision.java +++ b/Others/RootPrecision.java @@ -14,6 +14,8 @@ public class RootPrecision { // 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 index e6b995f48..247f3da09 100644 --- 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 index 01e4c8a8e..2857199d0 100644 --- a/Others/StackPostfixNotation.java +++ b/Others/StackPostfixNotation.java @@ -7,6 +7,7 @@ public class StackPostfixNotation { 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 class StackPostfixNotation { // "+", "-", "*", "/" } } + tokens.close(); return s.pop(); } } diff --git a/Others/TopKWords.java b/Others/TopKWords.java index 840c3c2f7..6cccfc27b 100644 --- a/Others/TopKWords.java +++ b/Others/TopKWords.java @@ -82,6 +82,7 @@ public class TopKWords { 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 index 2eca7fc74..7d35ed36d 100644 --- a/Others/TowerOfHanoi.java +++ b/Others/TowerOfHanoi.java @@ -22,5 +22,6 @@ class TowerOfHanoi { 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 index 06319f79d..cec0ddce0 100644 --- a/ciphers/Caesar.java +++ b/ciphers/Caesar.java @@ -126,6 +126,7 @@ public class Caesar { case 'd': System.out.println("DECODED MESSAGE IS \n" + decode(message, shift)); } + input.close(); } }