1652. Defuse the Bomb Easy

1/**
2 * [1652] Defuse the Bomb
3 *
4 * You have a bomb to defuse, and your time is running out! Your informer will provide you with a circular array code of length of n and a key k.
5 * To decrypt the code, you must replace every number. All the numbers are replaced simultaneously.
6 * 
7 * 	If k > 0, replace the i^th number with the sum of the next k numbers.
8 * 	If k < 0, replace the i^th number with the sum of the previous k numbers.
9 * 	If k == 0, replace the i^th number with 0.
10 * 
11 * As code is circular, the next element of code[n-1] is code[0], and the previous element of code[0] is code[n-1].
12 * Given the circular array code and an integer key k, return the decrypted code to defuse the bomb!
13 *  
14 * Example 1:
15 * 
16 * Input: code = [5,7,1,4], k = 3
17 * Output: [12,10,16,13]
18 * Explanation: Each number is replaced by the sum of the next 3 numbers. The decrypted code is [7+1+4, 1+4+5, 4+5+7, 5+7+1]. Notice that the numbers wrap around.
19 * 
20 * Example 2:
21 * 
22 * Input: code = [1,2,3,4], k = 0
23 * Output: [0,0,0,0]
24 * Explanation: When k is zero, the numbers are replaced by 0. 
25 * 
26 * Example 3:
27 * 
28 * Input: code = [2,4,9,3], k = -2
29 * Output: [12,5,6,13]
30 * Explanation: The decrypted code is [3+9, 2+3, 4+2, 9+4]. Notice that the numbers wrap around again. If k is negative, the sum is of the previous numbers.
31 * 
32 *  
33 * Constraints:
34 * 
35 * 	n == code.length
36 * 	1 <= n <= 100
37 * 	1 <= code[i] <= 100
38 * 	-(n - 1) <= k <= n - 1
39 * 
40 */
41pub struct Solution {}
42
43// problem: https://leetcode.com/problems/defuse-the-bomb/
44// discuss: https://leetcode.com/problems/defuse-the-bomb/discuss/?currentPage=1&orderBy=most_votes&query=
45
46// submission codes start here
47
48impl Solution {
49    pub fn decrypt(code: Vec<i32>, k: i32) -> Vec<i32> {
50        vec![]
51    }
52}
53
54// submission codes end
55
56#[cfg(test)]
57mod tests {
58    use super::*;
59
60    #[test]
61    fn test_1652() {
62    }
63}
64