-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDynamic Array (DS Java)
50 lines (41 loc) · 1.28 KB
/
Dynamic Array (DS Java)
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
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
class Result {
/*
* Complete the 'dynamicArray' function below.
*
* The function is expected to return an INTEGER_ARRAY.
* The function accepts following parameters:
* 1. INTEGER n
* 2. 2D_INTEGER_ARRAY queries
*/
public static List<Integer> dynamicArray(int n, List<List<Integer>> queries) {
// Write your code here
List<List<Integer>> computation = new ArrayList<>();
List<Integer> result = new ArrayList<>();
for (int i = 0; i < n; i++) {
computation.add(new ArrayList<>());
}
int lastAnswer = 0;
for (int i = 0; i < queries.size(); i++) {
List<Integer> q = queries.get(i);
if (q.get(0) == 1) {
computation.get((q.get(1) ^ lastAnswer) % n).add(q.get(2));
} else {
List<Integer> seq = computation.get((q.get(1) ^ lastAnswer) % n);
lastAnswer = seq.get(q.get(2) % seq.size());
result.add(lastAnswer);
}
}
return result;
}
}