fix: minor format

Author: Jer3myYu

java/Sort and Search/SortArrayCountingSort.java

@@ -8,7 +8,7 @@ public int[] sortArrayCountingSort(int[] nums) {
         // Count occurrences of each element in 'nums'.
         int[] counts = new int[max + 1];
         for (int num : nums) {
-            counts[num] += 1;
+            counts[num]++;
         }
         // Build the sorted array by appending each index 'i' to it a total 
         // of 'counts[i]' times.

java/Sort and Search/SortArrayQuicksort.java

@@ -25,7 +25,7 @@ private int partition(int[] nums, int left, int right) {
         for (int i = left; i < right; i++) {
             if (nums[i] < pivot) {
                 swap(nums, lo, i);
-                lo += 1;
+                lo++;
             }
         }
         // After partitioning, 'lo' will be positioned where the pivot should

java/Sort and Search/SortArrayQuicksortOptimized.java

@@ -27,7 +27,7 @@ private int partition(int[] nums, int left, int right) {
         for (int i = left; i < right; i++) {
             if (nums[i] < pivot) {
                 swap(nums, lo, i);
-                lo += 1;
+                lo++;
             }
         }
         // After partitioning, 'lo' will be positioned where the pivot should