数组中特殊等间距元素的和

// Problem statement:
// Given an array of integers, find the sum of the elements that are at indices which are multiples of a given number 'k'.
// For example, given an array [1,2,3,4,5,6] and k=2, the output should be 1+3+5=9.

import java.util.stream.IntStream;

public class Solution {
    public int sumOfSpecialElements(int[] nums, int k) {
        return IntStream.range(0, nums.length)
                .filter(i -> i % k == 0)
                .map(i -> nums[i])
                .sum();
    }
}