style: enable NeedBraces in checkstyle (#5227)

* enable style NeedBraces

* style: enable NeedBraces in checkstyle

---------

Co-authored-by: Samuel Facchinello <samuel.facchinello@piksel.com>

src/test/java/com/thealgorithms/datastructures/buffers/CircularBufferTest.java

@@ -40,21 +40,29 @@ class CircularBufferTest {
         buffer.put(generateInt());
         assertFalse(buffer.isFull());
 
-        for (int i = 1; i < BUFFER_SIZE; i++) buffer.put(generateInt());
+        for (int i = 1; i < BUFFER_SIZE; i++) {
+            buffer.put(generateInt());
+        }
         assertTrue(buffer.isFull());
     }
 
     @Test
     void get() {
         assertNull(buffer.get());
-        for (int i = 0; i < 100; i++) buffer.put(i);
-        for (int i = 0; i < BUFFER_SIZE; i++) assertEquals(i, buffer.get());
+        for (int i = 0; i < 100; i++) {
+            buffer.put(i);
+        }
+        for (int i = 0; i < BUFFER_SIZE; i++) {
+            assertEquals(i, buffer.get());
+        }
         assertNull(buffer.get());
     }
 
     @Test
     void put() {
-        for (int i = 0; i < BUFFER_SIZE; i++) assertTrue(buffer.put(generateInt()));
+        for (int i = 0; i < BUFFER_SIZE; i++) {
+            assertTrue(buffer.put(generateInt()));
+        }
         assertFalse(buffer.put(generateInt()));
     }
 
@@ -74,7 +82,9 @@ class CircularBufferTest {
             while (producerCountDownLatch.getCount() > 0) {
                 int count = (int) producerCountDownLatch.getCount();
                 boolean put = buffer.put(count);
-                while (!put) put = buffer.put(count);
+                while (!put) {
+                    put = buffer.put(count);
+                }
                 producerCountDownLatch.countDown();
             }
         });
@@ -85,7 +95,9 @@ class CircularBufferTest {
             while (consumerCountDownLatch.getCount() > 0) {
                 int count = (int) consumerCountDownLatch.getCount();
                 Integer item = buffer.get();
-                while (item == null) item = buffer.get();
+                while (item == null) {
+                    item = buffer.get();
+                }
                 resultAtomicArray.set(count - 1, item);
                 consumerCountDownLatch.countDown();
             }
@@ -111,7 +123,9 @@ class CircularBufferTest {
 
     private void shutDownExecutorSafely(ExecutorService executorService) {
         try {
-            if (!executorService.awaitTermination(1_000, TimeUnit.MILLISECONDS)) executorService.shutdownNow();
+            if (!executorService.awaitTermination(1_000, TimeUnit.MILLISECONDS)) {
+                executorService.shutdownNow();
+            }
         } catch (InterruptedException e) {
             executorService.shutdownNow();
         }
@@ -120,7 +134,9 @@ class CircularBufferTest {
     public List<Integer> getSortedListFrom(AtomicIntegerArray atomicArray) {
         int length = atomicArray.length();
         ArrayList<Integer> result = new ArrayList<>(length);
-        for (int i = 0; i < length; i++) result.add(atomicArray.get(i));
+        for (int i = 0; i < length; i++) {
+            result.add(atomicArray.get(i));
+        }
         result.sort(Comparator.comparingInt(o -> o));
         return result;
     }

src/test/java/com/thealgorithms/datastructures/queues/LinkedQueueTest.java

@@ -8,7 +8,9 @@ class LinkedQueueTest {
     @Test
     public void testQue() {
         LinkedQueue<Integer> queue = new LinkedQueue<>();
-        for (int i = 1; i < 5; i++) queue.enqueue(i);
+        for (int i = 1; i < 5; i++) {
+            queue.enqueue(i);
+        }
 
         assertEquals(queue.peekRear(), 4);
         assertEquals(queue.peek(2), 2);
@@ -20,7 +22,9 @@ class LinkedQueueTest {
         // iterates over all the elements present
         // as in the form of nodes
         queue.forEach(integer -> {
-            if (element[0]++ != integer) throw new AssertionError();
+            if (element[0]++ != integer) {
+                throw new AssertionError();
+            }
         });
     }
 }

src/test/java/com/thealgorithms/datastructures/trees/LazySegmentTreeTest.java

@@ -49,12 +49,13 @@ public class LazySegmentTreeTest {
         int[] arr = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
         LazySegmentTree lazySegmentTree = new LazySegmentTree(arr);
 
-        for (int i = 0; i < 10; i++)
+        for (int i = 0; i < 10; i++) {
             for (int j = i + 1; j < 10; j++) {
                 lazySegmentTree.updateRange(i, j, 1);
                 assertEquals(j - i, lazySegmentTree.getRange(i, j));
                 lazySegmentTree.updateRange(i, j, -1);
                 assertEquals(0, lazySegmentTree.getRange(i, j));
             }
+        }
     }
 }