使用for循环递归

Question

I am currently writing a program in which I have to calculate a number recursively using a for-loop. But unfortunately, I have no idea how to correctly implement this function since my current implementation does not calculate the correct answers.

public class Calc {

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        double k = sc.nextDouble();
        double e = sc.nextDouble();
        double q = sc.nextDouble();
        int n = sc.nextInt();
        for (int i = 0; i < n; i++) {
            k = (k + (i * e)) * (1 + q);  //The problem I have is that I don't know how to access the previous element of the for-loop
        }   

    }
}

Answer 1

Instead of your for loop:

for (int i = 0; i < n; i++) {
    k = (k + (i * e)) * (1 + q);
}

You can indeed use recursion.

Just make a method called calculateK() and call it recursively, like so:

public static double calculateK(double k, int i) {
    if (i == n) {
        return k;
    }
    else 
    {
        return calculateK((k + (i * e)) * (1 + q), i + 1);
    }
}