mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-07 01:35:16 +08:00
Cleanup unused imports (#3217)
This commit is contained in:
@ -1,6 +1,5 @@
|
||||
package com.thealgorithms.backtracking;
|
||||
|
||||
import java.util.Arrays;
|
||||
import java.util.LinkedList;
|
||||
import java.util.List;
|
||||
|
||||
|
@ -1,7 +1,5 @@
|
||||
package com.thealgorithms.maths;
|
||||
|
||||
import java.util.Random;
|
||||
|
||||
public class Ceil {
|
||||
|
||||
/**
|
||||
|
@ -36,8 +36,6 @@
|
||||
*/
|
||||
package com.thealgorithms.maths;
|
||||
|
||||
import java.util.*;
|
||||
|
||||
class DigitalRoot {
|
||||
|
||||
public static int digitalRoot(int n) {
|
||||
|
@ -1,6 +1,4 @@
|
||||
package com.thealgorithms.maths;
|
||||
|
||||
import java.util.Scanner;
|
||||
public class PascalTriangle {
|
||||
/**
|
||||
*In mathematics, Pascal's triangle is a triangular array of the binomial coefficients that arises
|
||||
|
@ -1,7 +1,5 @@
|
||||
package com.thealgorithms.maths;
|
||||
|
||||
import java.util.Scanner;
|
||||
|
||||
|
||||
public class SquareRootWithBabylonianMethod {
|
||||
/**
|
||||
|
Reference in New Issue
Block a user