algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-25 05:22:39 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: enable AvoidStarImport in checkstyle (#5141)

Browse Source
This commit is contained in:
Piotr Idzik
2024-05-05 20:48:56 +02:00
committed by GitHub
parent dc47e0aa42
commit 414835db11
188 changed files with 479 additions and 310 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/main/java/com/thealgorithms/datastructures/dynamicarray/DynamicArray.java
View File

@ -1,6 +1,10 @@
package com.thealgorithms.datastructures.dynamicarray;
import java.util.*;
import java.util.Arrays;
import java.util.ConcurrentModificationException;
import java.util.Iterator;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.function.Consumer;
import java.util.stream.Stream;
import java.util.stream.StreamSupport;

6
src/main/java/com/thealgorithms/datastructures/graphs/A_Star.java
View File

@ -3,7 +3,11 @@
*/
package com.thealgorithms.datastructures.graphs;
import java.util.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.List;
import java.util.PriorityQueue;
public class A_Star {

2
src/main/java/com/thealgorithms/datastructures/graphs/BellmanFord.java
View File

@ -1,6 +1,6 @@
package com.thealgorithms.datastructures.graphs;
import java.util.*;
import java.util.Scanner;
class BellmanFord /*
* Implementation of Bellman ford to detect negative cycles. Graph accepts

3
src/main/java/com/thealgorithms/datastructures/heaps/GenericHeap.java
View File

@ -1,6 +1,7 @@
package com.thealgorithms.datastructures.heaps;
import java.util.*;
import java.util.ArrayList;
import java.util.HashMap;
public class GenericHeap<T extends Comparable<T>> {

7
src/main/java/com/thealgorithms/datastructures/lists/SkipList.java
View File

@ -1,6 +1,11 @@
package com.thealgorithms.datastructures.lists;
import java.util.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.Objects;
import java.util.Random;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

6
src/main/java/com/thealgorithms/datastructures/trees/PostOrderTraversal.java
View File

@ -1,6 +1,10 @@
package com.thealgorithms.datastructures.trees;
import java.util.*;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.LinkedList;
import java.util.List;
/**
* Given tree is traversed in a 'post-order' way: LEFT -> RIGHT -> ROOT.

6
src/main/java/com/thealgorithms/datastructures/trees/ZigzagTraversal.java
View File

@ -1,6 +1,10 @@
package com.thealgorithms.datastructures.trees;
import java.util.*;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.LinkedList;
import java.util.List;
/**
* Given a binary tree.