Merge branch 'tasks-3065-3069' of github.com:jscrdev/Leetcode-in-java into tasks-3065-3069

Author: javadev

src/main/java/g3001_3100/s3068_find_the_maximum_sum_of_node_values/Solution.java

@@ -4,10 +4,11 @@
 // #2024_03_31_Time_1_ms_(100.00%)_Space_54.5_MB_(67.07%)
 
 public class Solution {
-    public long maximumValueSum(int[] A, int k, int[][] edges) {
+    public long maximumValueSum(int[] nums, int k, int[][] edges) {
         long res = 0;
-        int d = 1 << 30, c = 0;
-        for (int a : A) {
+        int d = 1 << 30;
+        int c = 0;
+        for (int a : nums) {
             int b = a ^ k;
             res += Math.max(a, b);
             c ^= a < b ? 1 : 0;

src/main/java/g3001_3100/s3069_distribute_elements_into_two_arrays_i/Solution.java

@@ -4,7 +4,8 @@
 
 public class Solution {
     public int[] resultArray(int[] nums) {
-        int s = 0, t = 1;
+        int s = 0;
+        int t = 1;
         for (int i = 2; i < nums.length; i++) {
             int p = i;
             if (nums[s] > nums[t]) {