Rekursion

package com.company;

public class Main {

    public static void main(String[] args) {
	// write your code here
        int[] arr = {-2,3,4,5};
        System.out.println(countPositives(arr, 0,3));
        char[] arr1 = {'a','b','c','d'};
        char[] arr2 = {'a','b','c','d'};
        System.out.println(contentCheck(arr1,arr2,3));
    }

    public static int countPositives(int[] arr, int d, int t){

        if(d <= t && t < arr.length){
            if(arr[t] > 0){
                return 1 + countPositives(arr, d, t-1);
            }
            else return 0 + countPositives(arr, d, t-1);
        }
        return 0;
    }

    public static boolean contentCheck(char[] arr1, char[] arr2, int i ){
        if(i>0 && i<arr1.length && i<arr2.length){
            return (arr1[i] == arr2[i]) && contentCheck(arr1, arr2,i-1);
        }
        else if (i==0){
            return (arr1[i] == arr2[i]);
        }
        else return false;
    }

}