refactor: fix readability issues,a and redundant check

Author: Alex Klymenko

src/main/java/com/thealgorithms/sorts/PatienceSort.java

@@ -47,7 +47,7 @@ private static <T extends Comparable<T>> List<List<T>> formPiles(final T[] array
         for (T x : array) {
             int pos = Collections.binarySearch(lastElements, x);
             if (pos < 0) {
-                pos = ~pos; // bitwise complement, which is equivalent to (-pos - 1)
+                pos = -pos - 1;
             }
 
             if (pos < piles.size()) {
@@ -75,9 +75,7 @@ private static <T extends Comparable<T>> List<List<T>> formPiles(final T[] array
     private static <T extends Comparable<T>> PriorityQueue<PileNode<T>> mergePiles(final List<List<T>> piles) {
         PriorityQueue<PileNode<T>> pq = new PriorityQueue<>();
         for (List<T> pile : piles) {
-            if (!pile.isEmpty()) {
-                pq.add(new PileNode<>(pile.removeLast(), pile));
-            }
+            pq.add(new PileNode<>(pile.removeLast(), pile));
         }
         return pq;
     }