From ed63a902892afd99b259b507f9f6436d5afb9883 Mon Sep 17 00:00:00 2001 From: Manan-Rathi <76519771+Manan-Rathi@users.noreply.github.com> Date: Fri, 1 Oct 2021 10:38:17 +0530 Subject: [PATCH] Fix typos in comments (#2354) --- Conversions/IntegerToRoman.java | 2 +- Misc/PalindromePrime.java | 2 +- Misc/WordBoggle.java | 4 ++-- 3 files changed, 4 insertions(+), 4 deletions(-) diff --git a/Conversions/IntegerToRoman.java b/Conversions/IntegerToRoman.java index 5c039a0f..fd8a0bb4 100644 --- a/Conversions/IntegerToRoman.java +++ b/Conversions/IntegerToRoman.java @@ -3,7 +3,7 @@ package Conversions; /** * Converting Integers into Roman Numerals * - *

('I', 1); ('IV',4); ('V', 5); ('IV',9); ('X', 10); ('XL',40; ('L', 50); ('XC',90); ('C', 100); + *

('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 index 50b115de..ea27a602 100644 --- 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 index e7f92642..2a87b0d6 100644 --- a/Misc/WordBoggle.java +++ b/Misc/WordBoggle.java @@ -3,8 +3,8 @@ import java.util.*; 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 boggleBoard(char[][] board, String[] words) {