leetcode

0 class Solution {

1 public:

2 vector<int> decrypt(vector<int> &code, int k) {

3 const int n = size(code);

4 vector<int> res(n, 0);

5

6 if (k == 0) return res;

7

8 auto [start, end] = k >= 0 ? tuple(1, k) : tuple(n + k, n - 1);

9 int sum = 0;

10

11 for (int i = start; i <= end; i++)

12 sum += code[i];

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

14 res[i] = sum;

15 sum -= code[start++ % n];

16 sum += code[++end % n];

17 }

18

19 return res;

20 }

21 };