Fixed idea

Author: javadev

src/main/java/g3601_3700/s3698_split_array_with_minimum_difference/Solution.java

@@ -7,7 +7,7 @@ public long splitArray(int[] nums) {
         int i = 1;
         int n = nums.length;
         long suml = nums[0];
-        long sumr = 0;
+        long sumr;
         while (i < n && nums[i] > nums[i - 1]) {
             suml += nums[i];
             i++;
@@ -28,10 +28,10 @@ public long splitArray(int[] nums) {
         if (suml <= sumr) {
             return sumr - suml;
         } else {
-            if (suml - sumr - 2 * pivot > 0) {
-                return suml - sumr - 2 * pivot;
+            if (suml - sumr - 2L * pivot > 0) {
+                return suml - sumr - 2L * pivot;
             } else {
-                return Math.min(suml - sumr, Math.abs(suml - sumr - 2 * pivot));
+                return Math.min(suml - sumr, Math.abs(suml - sumr - 2L * pivot));
             }
         }
     }