阵列挑战

Question

public class Testfor
{
    public static int ArrayChallenge(int[] arr)
    {
        int[] temp = new int[arr.length - 1];
        int diff = 0;

        for (int i = 0; i < arr.length - 1; i++)
        {
            diff = Math.abs(arr[i] - arr[i + 1]);
            temp[i] = diff;
        }
        arr = temp;
        for (int i:arr)
        {
            System.out.println(i);
        }
        if (arr.length > 1)
        {
            ArrayChallenge(arr);
        }
        else
        {
            diff = arr[0];
            System.out.println("diff" + diff);
        }
        return diff;
    }

    public static void main(String[] args)
    {
        // keep this function call here     
        //Scanner s = new Scanner(System.in);
        System.out.println("answer:" + ArrayChallenge(new int[] { 5, 7, 16, 1, 2 }));
    }
}

这里的输入是一个整数数组，最后应该通过找到两个元素之间的绝对差将数组缩小到一个元素的大小。

我正在使用递归来解决这个问题，但我得到了 1 作为答案，有人可以请人帮忙解决吗？

    input:[5,7,16,1,2]
    [2,9,15,1]
    [7,6,14]
    [1,8]
    [7]--->the array should reduce in the following manner to get an answer and finally should return the last element
    output:7

Answer 1

只保留返回值

public class Testfor
{
    public static int ArrayChallenge(int[] arr)
    {
        int[] temp = new int[arr.length - 1];
        int diff = 0;

        for (int i = 0; i < arr.length - 1; i++)
        {
            diff = Math.abs(arr[i] - arr[i + 1]);
            temp[i] = diff;
        }
        arr = temp;
        for (int i:arr)
        {
            System.out.println(i);
        }
        if (arr.length > 1)
        {
            diff = ArrayChallenge(arr);
        }
        else
        {
            diff = arr[0];
            System.out.println("diff" + diff);
        }
        return diff;
    }

    public static void main(String[] args)
    {
        // keep this function call here     
        //Scanner s = new Scanner(System.in);
        System.out.println("answer:" + ArrayChallenge(new int[] { 5, 7, 16, 1, 2 }));
    }
}