Fixed sonar

Author: javadev

src/main/java/g3101_3200/s3165_maximum_sum_of_subsequence_with_non_adjacent_elements/Solution.java

@@ -50,7 +50,7 @@ public Integer takeLast() {
             }
         }
 
-        private static Record[] seg;
+        private final Record[] seg;
         private final int[] nums;
 
         public SegTree(int[] nums) {
@@ -74,7 +74,7 @@ private void build(int i, int j, int k) {
         }
 
         // merge [2*k+1, 2*k+2] into k
-        private static void merge(int k) {
+        private void merge(int k) {
             seg[k].takeFirstSkipLast =
                     Math.max(
                             seg[2 * k + 1].takeFirstSkipLast + seg[2 * k + 2].skipLast(),
@@ -104,7 +104,7 @@ public void update(int idx, int val) {
             update(idx, val, k, i, j);
         }
 
-        private static void update(int idx, int val, int k, int i, int j) {
+        private void update(int idx, int val, int k, int i, int j) {
             if (i == j) {
                 seg[k].takeFirstTakeLast = val;
                 return;