1652_defuse_the_bomb.py

class Solution:
    def decrypt(self, code: List[int], k: int) -> List[int]:
        ans = []
        length = len(code)
        if k == 0:
            return [0 for i in range(len(code))]
        
        elif k > 0:
            for i in range(length):
                tmp = 0
                for j in range(1, k+1):
                    tmp += code[(i+j) % length]
                ans.append(tmp)
        else:
            for i in range(length):
                tmp = 0
                for j in range(1, -k+1):
                    tmp += code[(i-j) % length]
                ans.append(tmp)
        return ans

'''
    This is my personal record of solving Leetcode Problems. 
    If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
    Copyright (C) 2020-2022  mengxinayan

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
'''