hackerrank/Java/Data-Structure/1DArray.java at master · SedaKunda/hackerrank

This repository was archived by the owner on Aug 7, 2024. It is now read-only.

36 lines (29 loc) · 1.02 KB

This problem will test your knowledge on java array.

You are given an array of nn integers. A sub-array is "Negative" if sum of all the integers in that sub-array is negative. Count the number of "Negative sub-arrays" in the input array.

Note: Subarrays are contiguous chunks of the main array. For example if the array is {1,2,3,5} then some of the subarrays are {1}, {1,2,3}, {2,3,5}, {1,2,3,5} etc. But {1,2,5} is not an subarray as it is not contiguous.

import java.math.BigDecimal;

import java.util.*;

class 1DArray{

public static void main(String []argh)

{

Scanner sc= new Scanner(System.in);

int n=sc.nextInt();

int []s=new int[n];

int count = 0;

for(int i=0;i<n;i++) {

s[i] = sc.nextInt();

}

for (int i = 0; i < n; i++) {

int sum = 0;

for (int j = i; j < n; j++) {

sum+=s[j];

if (sum<0) {

count++;

}

System.out.println (count);

}

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

FilesExpand file tree

1DArray.java

Latest commit

History

1DArray.java

File metadata and controls