zoukankan      html  css  js  c++  java
  • Java实现递归阶乘

    public class Factorial{
        public static void main(String[] args){
            for (int i = -5; i <= 5; i++) {
                System.out.printf("%d! = %d
    ", i, negative(i));
            }
        }
    
        // 判断n是否为负数
        public static int negative(int n){
            if (n >= 0){
                return factorial(n);
            } else {
                return -factorial(-n);
            }
        }
    
        // 递归阶乘函数
        public static int factorial(int n){
            if (n == 0){
                return 1;
            } else {
                return factorial(n-1) * n;
            }
        }
    }
    Resistance is Futile!
  • 相关阅读:
    StackView
    横竖屏
    Html
    UILabel
    NSString
    NSPredicate|谓词
    iphone
    函数
    UIBezierPath
    UICollectionView
  • 原文地址:https://www.cnblogs.com/noonjuan/p/11446191.html
Copyright © 2011-2022 走看看