如何用递归的方式求数组的最大元素？

数据结构与算法

有返回的递归经典之作

public class Solution {
    public int findMax(int[] nums, int left, int max) {
        if (left == nums.length) {
            System.out.println(max);
            return max;
        }
        for (int i = left; i < nums.length; i++) {
            if (nums[i] > max) {
                max = nums[i];
            }
            return findMax(nums, i + 1, max);
        }
        return -1;
    }
    public static void main(String[] args) {
        Solution solution = new Solution();
        int[] nums = {1, 2, 10, 4, 5, 6, 6};
        System.out.println("result:" + solution.findMax(nums, 0, 0));
    }
}