Fix typos in comments (TheAlgorithms#2354)

Manan-Rathi · web-flow · commit ed63a902892a · 2021-10-01T08:08:17.000+03:00
diff --git a/Conversions/IntegerToRoman.java b/Conversions/IntegerToRoman.java
@@ -3,7 +3,7 @@
 /**
  * Converting Integers into Roman Numerals
  *
- * <p>('I', 1); ('IV',4); ('V', 5); ('IV',9); ('X', 10); ('XL',40; ('L', 50); ('XC',90); ('C', 100);
+ * <p>('I', 1); ('IV',4); ('V', 5); ('IX',9); ('X', 10); ('XL',40); ('L', 50); ('XC',90); ('C', 100);
  * ('D', 500); ('M', 1000);
  */
 public class IntegerToRoman {
diff --git a/Misc/PalindromePrime.java b/Misc/PalindromePrime.java
@@ -7,7 +7,7 @@ public class PalindromePrime {
   public static void main(String[] args) { // Main funtion
     Scanner in = new Scanner(System.in);
     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
+    int n = in.nextInt(); // Input of how many first palindromic prime we want
     functioning(n); // calling function - functioning
     in.close();
   }
diff --git a/Misc/WordBoggle.java b/Misc/WordBoggle.java
@@ -3,8 +3,8 @@
 public class WordBoggle {
 
   /**
-   * O(nm * 8^s + ws) time where n=width of boggle board, m=height of boggle board, s=length of
-   * longest word in string array, w= length of string array, 8 is due to 8 explorable neighbours
+   * O(nm * 8^s + ws) time where n = width of boggle board, m = height of boggle board, s = length of
+   * longest word in string array, w = length of string array, 8 is due to 8 explorable neighbours
    * O(nm + ws) space.
    */
   public static List<String> boggleBoard(char[][] board, String[] words) {

Original file line number	Diff line number	Diff line change
`@@ -3,7 +3,7 @@`
`3`	`3`	`/**`
`4`	`4`	`* Converting Integers into Roman Numerals`
`5`	`5`	`*`
`6`		`- * <p>('I', 1); ('IV',4); ('V', 5); ('IV',9); ('X', 10); ('XL',40; ('L', 50); ('XC',90); ('C', 100);`
	`6`	`+ * <p>('I', 1); ('IV',4); ('V', 5); ('IX',9); ('X', 10); ('XL',40); ('L', 50); ('XC',90); ('C', 100);`
`7`	`7`	`* ('D', 500); ('M', 1000);`
`8`	`8`	`*/`
`9`	`9`	`public class IntegerToRoman {`
Original file line number	Diff line number	Diff line change
`@@ -7,7 +7,7 @@ public class PalindromePrime {`
`7`	`7`	`public static void main(String[] args) { // Main funtion`
`8`	`8`	`Scanner in = new Scanner(System.in);`
`9`	`9`	`System.out.println("Enter the quantity of First Palindromic Primes you want");`
`10`		`- int n = in.nextInt(); // Input of how many first pallindromic prime we want`
	`10`	`+ int n = in.nextInt(); // Input of how many first palindromic prime we want`
`11`	`11`	`functioning(n); // calling function - functioning`
`12`	`12`	`in.close();`
`13`	`13`	`}`