数组集合中获取最长或者最短的字符串

import java.util.ArrayList;
import java.util.List;

public class Test {

    public static void main(String[] args) {
        String[] strings = {
                "12345",
                "123456",
                "1",
                "123456789",
                "1234567",
                "123",
                "1234",
                "12345678",
                "12"
        };

        List<String> max = getMax(strings);
        List<String> min = getMin(strings);
        for (String s : max) {
            System.out.println("max ======== " + s);
        }
        for (String s : min) {
            System.out.println("min ======== " + s);
        }
    }
    //max ======== 123456789
	//min ======== 1


    public static List<String> getMax(String[] str) {
        int maxLength = Integer.MIN_VALUE;
        List<String> maxList = new ArrayList<>();
        for (String s : str) {
            if (s.length() > maxLength) {
                maxLength = s.length();
                maxList.clear();
                maxList.add(s);
            } else if (s.length() == maxLength) {
                maxList.add(s);
            }
        }
        return maxList;
    }

    public static List<String> getMin(String[] str) {
        int minLength = Integer.MAX_VALUE;
        List<String> minList = new ArrayList<>();
        for (String s : str) {
            if (s.length() < minLength) {
                minLength = s.length();
                minList.clear();
                minList.add(s);
            } else if (s.length() == minLength) {
                minList.add(s);
            }
        }
        return minList;
    }
}