pls write the codes as simple as possible. Thank you. JAVA We define the followi
ID: 3841499 • Letter: P
Question
pls write the codes as simple as possible.
Thank you.
JAVA
We define the following: A subarray of an n-element array is an array composed from a contiguous block of original the array's elements. For example, if array = [1, 2, 3], then the subarrays are [1], [2], [3], [1, 2], [2, 3], and [1, 2, 3]. Something like [1, 3] would not be a subarray as it's not a contiguous subsection of the original array. The sum of an array is the total sum of its elements. An array's sum is negative if the total sum of its elements is negative. An array's sum is positive if the total sum of its elements is positive. Given an array of n integers, find and print its number of negative subarrays on a new line. Input Format The first line contains a single integer, n, denoting the length of array A = [a_0, a_1, ..., a_n - 1]. The second line contains n space-separated integers describing each respective element, a in array A. Output Format Print the number of subarrays of A having negative sums. Sample Input 5 1 -2 4 -5 1. Sample Output 9 Explanation There are nine negative subarrays of A = [1, -2, 4, -5, 1]: 1. [1: 1] rightarrow -2 2. [3: 3] rightarrow -5 3. [0: 1] rightarrow 1 + -2 = -1 4. [2: 3] rightarrow 4 + -5 = -1 5. [3: 4] rightarrow -5 + 1 = -4 6. [1: 3] rightarrow -2 + 4 + -5 = -3 7. [0: 3] rightarrow 1 + -2 + 4 + -5 = -2 8. [1: 4] rightarrow -2 + 4 + -5 + 1 = -2 9. [0: 4] rightarrow 1 + -2 + 4 + -5 + 1 = -1 Thus, we print 9 on a new line.Explanation / Answer
The below solution has time complexity of O(n2) using Brute-force approach. It calculates sum of contiguous subarray elements, checks whether it is negative and prints required answer.
import java.util.*;
import java.lang.*;
import java.io.*;
class Solution
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner sn = new Scanner(System.in);
int n = sn.nextInt();
int sum=0, neg=0;
int[] arr = new int[n];
for(int i=0; i<n;i++)
arr[i] = sn.nextInt();
for(int i=0; i<n; i++)
{
for(int j=i;j<n;j++)
{
sum=sum+arr[j];
if(sum<0)
neg++;
}
sum=0;
}
System.out.println(neg);
}
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.