-
Notifications
You must be signed in to change notification settings - Fork 0
/
Adding Ones
63 lines (48 loc) · 1.52 KB
/
Adding Ones
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
//{ Driver Code Starts
//Initial Template for Java
import java.util.*;
import java.lang.*;
import java.io.*;
class GFG {
public static void main(String[] args) throws IOException
{
BufferedReader br =
new BufferedReader(new InputStreamReader(System.in));
int t =
Integer.parseInt(br.readLine().trim()); // Inputting the testcases
while(t-->0)
{
StringTokenizer stt = new StringTokenizer(br.readLine());
int n = Integer.parseInt(stt.nextToken());
int k = Integer.parseInt(stt.nextToken());
int a[] = new int[n];
int updates[] = new int[k];
String inputLine[] = br.readLine().trim().split(" ");
for (int i = 0; i < k; i++) {
updates[i] = Integer.parseInt(inputLine[i]);
}
Solution obj = new Solution();
obj.update(a, n, updates, k);
StringBuilder output = new StringBuilder();
for(int i = 0; i < n; i++)
output.append(a[i] + " ");
System.out.println(output);
}
}
}
// } Driver Code Ends
//User function Template for Java
class Solution {
public static void update(int a[], int n, int updates[], int k)
{
// Your code goes here
for(int i=0;i<k;i++){
a[updates[i]-1]++;
}
int temp=0;
for(int i=0;i<n;i++){
a[i]+=temp;
temp=a[i];
}
}
}