HackerRank Java- Subarray
Given an array of n integers, find and print its number of negative subarrays on a new line.
- import java.io.*;
- import java.util.*;
- import java.text.*;
- import java.math.*;
- import java.util.regex.*;
-
- public class Solution {
-
- public static void main(String[] args) {
- Scanner sc = new Scanner(System.in);
- int n = sc.nextInt();
- int[] a = new int[n];
-
- for (int i = 0; i < n; i++) {
- a[i] = sc.nextInt();
- }
- sc.close();
-
- int negativeSubarrays = 0;
- for (int i = 0; i < n; i++) {
- int sum = 0;
- for (int j = i; j < n; j++) {
- sum += a[j];
- if (sum < 0) {
- negativeSubarrays++;
- }
- }
- }
- System.out.println(negativeSubarrays);
- }
- }