Java recursion with one return statement

Question

Is it possible to add the numbers 1 to n recursively in Java with one return statement? How would you change the standard solution:

public static int sum(int n) {
   if(n == 1) return n;
    else return n + sum(n - 1);
}

Answer 1

return n == 1 ? n : n + sum(n-1);

Answer 2

You could use simple maths without recursion:

public static int sum(int n) {
   return n * (n + 1) / 2;
}

Answer 3

Yes, by making use of the ternary operator :

public static int sum(int n) {
    return n == 1 ? n : n + sum(n - 1);
}