使用递归在数组中寻找最大值java

Question

我正在寻找一个递归方法来找到数组中的最大值（我知道已经是迭代的） 对于基本情况，我提出了这个想法即：

if(t.length == 1) 
    return t[0]; 

，但我不知道递归调用一步 我会很高兴，如果有人可以帮助我

Answer 1

int largest(int[] a, int start, int largest) { 
    if (start == a.length) 
     return largest; 
    else { 
     int l = (a[start] > largest ? a[start] : largest); 
     return largest(a, start + 1, l); 
    } 
} 

Answer 2

import java.util.Arrays;
 

public class RecMax { public static void main(String[] args) {
 

     int values[] = {1,2,3,4,5,10,8,9,7,3,2,8}; 

     int maxvalue = max(Integer.MIN_VALUE, values); 

     System.out.println(maxvalue); 
    } 

    public static int max(int cur, int[] values) { 
     //just for clarity 
     int len = values.length; 

     //stop condition 
     //if all the array has been examined than cur contains the max 
     if (len == 0) { 
      return cur; 
     } 

     //if the last element of the array is greater than the current then this is 
     //the new temporary max, else the current max is the one already found 
     int tmpMax = values[len - 1] > cur ? values[len - 1] : cur; 

     //recursion 
     //examine the remaining part of the array (len -1) 
     //copying the array is a waste but it looks clear to me what a recursion means 
     return max(tmpMax, Arrays.copyOfRange(values, 0, len - 1)); 
    } 
}