mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-25 05:22:39 +08:00
style: enable AvoidStarImport
in checkstyle (#5141)
This commit is contained in:
@ -1,6 +1,6 @@
|
||||
package com.thealgorithms.maths;
|
||||
|
||||
import java.util.*;
|
||||
import java.util.Scanner;
|
||||
|
||||
/*
|
||||
* @author Ojasva Jain
|
||||
|
@ -1,7 +1,8 @@
|
||||
package com.thealgorithms.maths;
|
||||
|
||||
import java.math.BigInteger;
|
||||
import java.util.*;
|
||||
import java.util.ArrayList;
|
||||
import java.util.List;
|
||||
|
||||
public class KaprekarNumbers {
|
||||
|
||||
|
@ -1,6 +1,8 @@
|
||||
package com.thealgorithms.maths;
|
||||
|
||||
import java.util.*;
|
||||
import java.util.ArrayList;
|
||||
import java.util.Collections;
|
||||
import java.util.Scanner;
|
||||
|
||||
class KeithNumber {
|
||||
|
||||
|
@ -5,7 +5,9 @@ A number is a Krishnamurthy number if the sum of the factorials of the digits of
|
||||
to the number itself. For example, 1, 2 and 145 are Krishnamurthy numbers. Krishnamurthy number is
|
||||
also referred to as a Strong number.
|
||||
*/
|
||||
import java.io.*;
|
||||
import java.io.BufferedReader;
|
||||
import java.io.IOException;
|
||||
import java.io.InputStreamReader;
|
||||
|
||||
public class KrishnamurthyNumber {
|
||||
|
||||
|
@ -1,6 +1,6 @@
|
||||
package com.thealgorithms.maths;
|
||||
|
||||
import java.util.*;
|
||||
import java.util.Scanner;
|
||||
|
||||
/**
|
||||
* Is a common mathematics concept to find the smallest value number
|
||||
|
@ -1,6 +1,6 @@
|
||||
package com.thealgorithms.maths;
|
||||
|
||||
import java.util.*;
|
||||
import java.util.Scanner;
|
||||
|
||||
/*A magic square of order n is an arrangement of distinct n^2 integers,in a square, such that the n
|
||||
numbers in all rows, all columns, and both diagonals sum to the same constant. A magic square
|
||||
|
Reference in New Issue
Block a user