algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2026-03-13 08:40:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: enabled InnerAssignment in checkstyle (#5162)

Browse Source 
* style: enabled InnerAssignment in checkstyle

* Refactor code formatting in KnapsackMemoization.java and UnionFind.java

* style: remove redundant blank line

* style: mark `includeCurrentItem` and `excludeCurrentItem` as `final`

* style: remove `KnapsackMemoization` from `pmd-exclude.properties`

* style: use `final`

---------

Co-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>
This commit is contained in:
Godwill Christopher
2024-05-16 10:46:03 -06:00
committed by GitHub
parent f8e62fbb90
commit 0f42e995a4
15 changed files with 41 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
src/main/java/com/thealgorithms/datastructures/queues/CircularQueue.java
View File

@@ -54,7 +54,8 @@ public class CircularQueue {
int res = arr[beginningOfQueue];
arr[beginningOfQueue] = Integer.MIN_VALUE;
if (beginningOfQueue == topOfQueue) {
beginningOfQueue = topOfQueue = -1;
beginningOfQueue = -1;
topOfQueue = -1;
} else if (beginningOfQueue + 1 == size) {
beginningOfQueue = 0;
} else {

7
src/main/java/com/thealgorithms/datastructures/queues/LinkedQueue.java
View File

@@ -44,7 +44,9 @@ public class LinkedQueue<T> implements Iterable<T> {
* Init LinkedQueue
*/
public LinkedQueue() {
front = rear = new Node<>();
front = new Node<>();
rear = front;
}
/**
@@ -146,7 +148,8 @@ public class LinkedQueue<T> implements Iterable<T> {
@Override
public T next() {
return (node = node.next).data;
node = node.next;
return node.data;
}
};
}