用递归方法求10的阶乘

class recursion{
public static void main(String[] args) {
long a = factorial(10);
System.out.println(a);
}

static long factorial(int target) {
    if (target == 1) {
        return 1;
    }
    return target * factorial(target - 1);
}

}