Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix typos in comments (#2354)

Browse Source
This commit is contained in:
Manan-Rathi 2021-10-01 10:38:17 +05:30 committed by GitHub
parent 40e055b03b
commit ed63a90289
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
3 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Conversions/IntegerToRoman.java
View File

@ -3,7 +3,7 @@ package Conversions;
/** /**
* Converting Integers into Roman Numerals * 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); * ('D', 500); ('M', 1000);
*/ */
public class IntegerToRoman { public class IntegerToRoman {

2
Misc/PalindromePrime.java
View File

@ -7,7 +7,7 @@ public class PalindromePrime {
public static void main(String[] args) { // Main funtion public static void main(String[] args) { // Main funtion
Scanner in = new Scanner(System.in); Scanner in = new Scanner(System.in);
System.out.println("Enter the quantity of First Palindromic Primes you want"); 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 functioning(n); // calling function - functioning
in.close(); in.close();
} }

4
Misc/WordBoggle.java
View File

@ -3,8 +3,8 @@ import java.util.*;
public class WordBoggle { public class WordBoggle {
/** /**
* O(nm * 8^s + ws) time where n=width of boggle board, m=height of boggle board, s=length of * 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 * longest word in string array, w = length of string array, 8 is due to 8 explorable neighbours
* O(nm + ws) space. * O(nm + ws) space.
*/ */
public static List<String> boggleBoard(char[][] board, String[] words) { public static List<String> boggleBoard(char[][] board, String[] words) {