algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-24 04:54:21 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: enable InvalidJavadocPosition in checkstyle (#5237)

Browse Source 
enable style InvalidJavadocPosition

Co-authored-by: Samuel Facchinello <samuel.facchinello@piksel.com>
This commit is contained in:
Samuel Facchinello
2024-06-18 19:34:22 +02:00
committed by GitHub
parent 39e065437c
commit 74e51990c1
37 changed files with 284 additions and 358 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/main/java/com/thealgorithms/others/BankersAlgorithm.java
View File

@ -1,5 +1,7 @@
package com.thealgorithms.others;
import java.util.Scanner;
/**
* This file contains an implementation of BANKER'S ALGORITM Wikipedia:
* https://en.wikipedia.org/wiki/Banker%27s_algorithm
@ -18,8 +20,6 @@ package com.thealgorithms.others;
*
* @author AMRITESH ANAND (https://github.com/amritesh19)
*/
import java.util.Scanner;
public final class BankersAlgorithm {
private BankersAlgorithm() {
}

9
src/main/java/com/thealgorithms/others/Dijkstra.java
View File

@ -1,5 +1,9 @@
package com.thealgorithms.others;
import java.util.HashMap;
import java.util.Map;
import java.util.NavigableSet;
import java.util.TreeSet;
/**
* Dijkstra's algorithm,is a graph search algorithm that solves the
* single-source shortest path problem for a graph with nonnegative edge path
@ -15,11 +19,6 @@ package com.thealgorithms.others;
* https://rosettacode.org/wiki/Dijkstra%27s_algorithm#Java Also most of the
* comments are from RosettaCode.
*/
import java.util.HashMap;
import java.util.Map;
import java.util.NavigableSet;
import java.util.TreeSet;
public final class Dijkstra {
private Dijkstra() {
}

4
src/main/java/com/thealgorithms/others/MemoryManagementAlgorithms.java
View File

@ -1,11 +1,9 @@
package com.thealgorithms.others;
import java.util.ArrayList;
/**
* @author Alexandros Lemonaris
*/
import java.util.ArrayList;
public abstract class MemoryManagementAlgorithms {
/**

9
src/main/java/com/thealgorithms/others/RabinKarp.java
View File

@ -1,12 +1,13 @@
package com.thealgorithms.others;
import java.util.Scanner;
/**
* @author Prateek Kumar Oraon (https://github.com/prateekKrOraon)
*
An implementation of Rabin-Karp string matching algorithm
Program will simply end if there is no match
*/
import java.util.Scanner;
// An implementation of Rabin-Karp string matching algorithm
// Program will simply end if there is no match
public final class RabinKarp {
private RabinKarp() {
}

3
src/main/java/com/thealgorithms/others/RotateMatrixBy90Degrees.java
View File

@ -1,11 +1,10 @@
package com.thealgorithms.others;
import java.util.Scanner;
/**
* Given a matrix of size n x n We have to rotate this matrix by 90 Degree Here
* is the algorithm for this problem .
*/
import java.util.Scanner;
final class RotateMatrixBy90Degrees {
private RotateMatrixBy90Degrees() {
}