用递归的方法算出给定字符串的最大连续重复字符的重复次数

package com.yan.test01;

public class LongestSubString {

    // 用递归的方法算出给定字符串的最大连续重复字符的重复次数
    public LongestSubString() {
    }

    public static int maxLength(String str, int position, int count, int maxLength) {

        if (position == str.length()) {
            return maxLength;
        }
        if (str.charAt(position) == str.charAt(position - 1)) {
            count++;
            if (count > maxLength) {
                maxLength = count;
            }
        } else {
            count = 1;
        }
        return maxLength(str, position + 1, count, maxLength);
    }

    public static void main(String[] args) {
        // input : "abdsdxxxhbbbbbasdaaf"
        String str = "abdsdxxxhbbbbbasdaaf"; // "bbbbb"----5
        // String str = "a"; expected output: 1
        // String str = ""; expected output: 0
        // String str = null; expected output: 0
        if (str == null || str.isEmpty()) {
            System.out.println(0);
        } else if (str.length() == 1) {
            System.out.println(1);
        } else {
            System.out.println(maxLength(str, 1, 1, 1));
        }

    }

}