Skip to content

Commit dfcef2d

Browse files
refactor: moved comments above class declarations
1 parent 0b21bb0 commit dfcef2d

5 files changed

Lines changed: 9 additions & 14 deletions

File tree

src/main/java/com/thealgorithms/dynamicprogramming/UniquePaths.java

Lines changed: 4 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,7 @@
1+
package com.thealgorithms.dynamicprogramming;
2+
3+
import java.util.Arrays;
4+
15
/**
26
* Author: Siddhant Swarup Mallick
37
* Github: https://github.com/siddhant2002
@@ -12,11 +16,6 @@
1216
* This program calculates the number of unique paths possible for a robot to reach the bottom-right corner
1317
* of an m x n grid using dynamic programming.
1418
*/
15-
16-
package com.thealgorithms.dynamicprogramming;
17-
18-
import java.util.Arrays;
19-
2019
public final class UniquePaths {
2120

2221
private UniquePaths() {

src/main/java/com/thealgorithms/dynamicprogramming/WildcardMatching.java

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,5 @@
1+
package com.thealgorithms.dynamicprogramming;
2+
13
/**
24
*
35
* Author: Janmesh Singh
@@ -11,9 +13,6 @@
1113
* Use DP to return True if the pattern matches the entire text and False otherwise
1214
*
1315
*/
14-
15-
package com.thealgorithms.dynamicprogramming;
16-
1716
public final class WildcardMatching {
1817
private WildcardMatching() {
1918
}

src/main/java/com/thealgorithms/maths/DudeneyNumber.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,11 @@
1+
package com.thealgorithms.maths;
2+
13
/**
24
* A number is said to be Dudeney if the sum of the digits, is the cube root of the entered number.
35
* Example- Let the number be 512, its sum of digits is 5+1+2=8. The cube root of 512 is also 8.
46
* Since, the sum of the digits is equal to the cube root of the entered number;
57
* it is a Dudeney Number.
68
*/
7-
package com.thealgorithms.maths;
8-
99
public final class DudeneyNumber {
1010
private DudeneyNumber() {
1111
}

src/main/java/com/thealgorithms/scheduling/RRScheduling.java

Lines changed: 1 addition & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,3 @@
1-
/**
2-
* @author Md Asif Joardar
3-
*/
4-
51
package com.thealgorithms.scheduling;
62

73
import com.thealgorithms.devutils.entities.ProcessDetails;
@@ -11,6 +7,7 @@
117
import java.util.Queue;
128

139
/**
10+
* @author Md Asif Joardar
1411
* The Round-robin scheduling algorithm is a kind of preemptive First come, First Serve CPU
1512
* Scheduling algorithm. This can be understood here -
1613
* https://www.scaler.com/topics/round-robin-scheduling-in-os/

src/test/java/com/thealgorithms/strings/CharacterSameTest.java renamed to src/test/java/com/thealgorithms/strings/CharactersSameTest.java

File renamed without changes.

0 commit comments

Comments
 (0)