You are viewing a single comment's thread. Return to all comments →
cpp solution:
vector<int> dynamicArray(int n, vector<vector<int>> queries) { int lastAnswer = 0; vector<int> lastAnswers; vector<vector<int>> arr; for (int i = 0; i < n; i++) { vector<int> emptyVec; arr.push_back(emptyVec); } for (auto q : queries) { if (q[0] == 1) { // query 1 int idx = ((q[1]^lastAnswer)%n); arr[idx].push_back(q[2]); } else { //query 2 int idx = ((q[1]^lastAnswer)%n); int idxTwo = q[2]%arr[idx].size(); lastAnswer = arr[idx][idxTwo]; lastAnswers.push_back(lastAnswer); } } return lastAnswers; }
Seems like cookies are disabled on this browser, please enable them to open this website
Dynamic Array
You are viewing a single comment's thread. Return to all comments →
cpp solution: