mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-24 04:54:21 +08:00
style: enable AvoidStarImport
in checkstyle (#5141)
This commit is contained in:
@ -1,6 +1,6 @@
|
||||
package com.thealgorithms.misc;
|
||||
|
||||
import java.util.*;
|
||||
import java.util.Arrays;
|
||||
|
||||
public class RangeInSortedArray {
|
||||
|
||||
|
@ -1,6 +1,6 @@
|
||||
package com.thealgorithms.misc;
|
||||
|
||||
import java.util.*;
|
||||
import java.util.Scanner;
|
||||
|
||||
/**
|
||||
* The array is divided into four sections: a[1..Lo-1] zeroes a[Lo..Mid-1] ones
|
||||
|
@ -1,6 +1,6 @@
|
||||
package com.thealgorithms.misc;
|
||||
|
||||
import java.util.*;
|
||||
import java.util.Scanner;
|
||||
|
||||
/*
|
||||
*A matrix is sparse if many of its coefficients are zero (In general if 2/3rd of matrix elements
|
||||
|
@ -1,6 +1,14 @@
|
||||
package com.thealgorithms.misc;
|
||||
|
||||
import java.util.*;
|
||||
import java.util.ArrayList;
|
||||
import java.util.Arrays;
|
||||
import java.util.Collections;
|
||||
import java.util.HashMap;
|
||||
import java.util.HashSet;
|
||||
import java.util.LinkedHashSet;
|
||||
import java.util.List;
|
||||
import java.util.Scanner;
|
||||
import java.util.Set;
|
||||
|
||||
public class ThreeSumProblem {
|
||||
|
||||
|
@ -1,6 +1,12 @@
|
||||
package com.thealgorithms.misc;
|
||||
|
||||
import java.util.*;
|
||||
import java.util.ArrayList;
|
||||
import java.util.Arrays;
|
||||
import java.util.HashMap;
|
||||
import java.util.HashSet;
|
||||
import java.util.List;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
|
||||
public class WordBoggle {
|
||||
|
||||
|
Reference in New Issue
Block a user