From f10a0f91ddb72790715cefd382882a2a98711c6c Mon Sep 17 00:00:00 2001
From: Valentyn Kolesnikov <javadev75@gmail.com>
Date: Tue, 16 Apr 2024 00:05:11 +0300
Subject: [PATCH] Improved task 3072

---
 .../Solution.java                                           | 6 +-----
 1 file changed, 1 insertion(+), 5 deletions(-)

diff --git a/src/main/java/g3001_3100/s3072_distribute_elements_into_two_arrays_ii/Solution.java b/src/main/java/g3001_3100/s3072_distribute_elements_into_two_arrays_ii/Solution.java
index d3de0f349..33f6b96e0 100644
--- a/src/main/java/g3001_3100/s3072_distribute_elements_into_two_arrays_ii/Solution.java
+++ b/src/main/java/g3001_3100/s3072_distribute_elements_into_two_arrays_ii/Solution.java
@@ -6,7 +6,7 @@
 import java.util.Arrays;
 
 public class Solution {
-    static class BIT {
+    private static class BIT {
         private final int[] tree;
 
         public BIT(int size) {
@@ -26,7 +26,6 @@ public int rsq(int ind) {
                 sum += tree[ind];
                 ind -= lsb(ind);
             }
-
             return sum;
         }
 
@@ -47,7 +46,6 @@ public int[] resultArray(int[] source) {
         bit1.update(nums[0]);
         BIT bit2 = new BIT(nums.length);
         bit2.update(nums[1]);
-
         for (int i = 2; i < nums.length; i++) {
             int g1 = p1 + 1 - bit1.rsq(nums[i]);
             int g2 = p2 + 1 - bit2.rsq(nums[i]);
@@ -61,11 +59,9 @@ public int[] resultArray(int[] source) {
                 bit1.update(nums[i]);
             }
         }
-
         for (int i = p1 + 1; i < arr1.length; i++) {
             arr1[i] = arr2[i - p1 - 1];
         }
-
         return arr1;
     }