用递归判断一个数组是否递增 JAVA代码

最新推荐文章于 2021-11-20 19:26:15 发布

李意文

最新推荐文章于 2021-11-20 19:26:15 发布

阅读量1.8k

点赞数

分类专栏：算法文章标签：数组递归递增

本文链接：https://blog.csdn.net/u014698348/article/details/48848601

版权

算法专栏收录该内容

34 篇文章 0 订阅

订阅专栏

package AlgorithmTest;

/**
 * Created by dell on 2015/10/1.
 */
public class JadgeIncreseArrayWithRecursionTest {
    public static void main(String[] args) {
        int[] array = new int[]{1, 2, 5, 4};
        System.out.println(JadgeIncreseArrayWithRecursion(array));
    }

    public static boolean JadgeIncreseArrayWithRecursion(int[] array){
        return JadgeIncreseArrayWithRecursion(array, 0);
    }

    private static boolean JadgeIncreseArrayWithRecursion(int[] array, int begin){
        if (begin == array.length - 1){
            return true;
        }else{
            return array[begin] < array[begin + 1] &&  JadgeIncreseArrayWithRecursion(array, begin + 1);
        }
    }


}