updated Trie problem

Java/Data Structures/Java Subarray/Solution.java

@@ -4,16 +4,15 @@
 
 import java.util.Scanner;
 
-// Our subarray must be contiguous, so we have O(n^2) contiguous subarrays
+// A subarray must be contiguous. There are O(n^2) contiguous subarrays.
 
 //  Time Complexity: O(n^2)
 // Space Complexity: O(1)
 public class Solution {
     public static void main(String[] args) {
-        /* Save input */
         Scanner scan = new Scanner(System.in);
         int size     = scan.nextInt();
-        int [] array = new int[size];        
+        int[] array = new int[size];        
         for (int i = 0; i < size; i++) {
             array[i] = scan.nextInt();
         }
@@ -22,17 +21,16 @@ public class Solution {
         System.out.println(negativeSubarrays(array));
     }
     
-    private static int negativeSubarrays(int [] array) {
+    private static int negativeSubarrays(int[] array) {
         int count = 0;
-        int sum   = 0;
         for (int i = 0; i < array.length; i++) {
+            int sum = 0;
             for (int j = i; j < array.length; j++) {
                 sum += array[j];
                 if (sum < 0) {
                     count++;
                 }
             }
-            sum = 0;
         }
         return count;
     }