g1601_1700.s1652_defuse_the_bomb.Solution Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.35

package g1601_1700.s1652_defuse_the_bomb;

// #Easy #Array #2022_04_22_Time_0_ms_(100.00%)_Space_42.5_MB_(72.00%)

public class Solution {
    public int[] decrypt(int[] code, int k) {
        int[] result = new int[code.length];
        int len = code.length;
        if (k == 0) {
            for (int i = 0; i < code.length; i++) {
                result[i] = 0;
            }
        } else if (k > 0) {
            int kSum = 0;
            for (int i = 1; i <= k; i++) {
                kSum += code[i];
            }
            result[0] = kSum;
            for (int i = 1; i < len; i++) {
                kSum -= code[i];
                kSum += code[(i + k) % len];
                result[i] = kSum;
            }
        } else {
            int kSum = 0;
            int kVal = Math.abs(k);
            for (int i = len - 1; i >= len - kVal; i--) {
                kSum += code[i];
            }
            result[0] = kSum;
            for (int i = 1; i < len; i++) {
                kSum -= code[(len - kVal + i - 1) % len];
                kSum += code[i - 1];
                result[i] = kSum;
            }
        }
        return result;
    }
}