撬动offer：基于一道美团算法题​的分析

import java.util.Scanner;
import java.util.*;
import java.lang.Integer;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String lineStr = scanner.nextLine();
        String[] elements = lineStr.split(" ");
        List<Integer> list = new ArrayList<Integer>();
        for (int i = 0; i < elements.length; i++) {
            Integer val = Integer.parseInt(elements[i]);
            if(!list.contains(val)){
                list.add(val);
            }
        }
        Collections.sort(list);
        System.out.println(list);
        int targetLen = 0;
        int startNum = list.get(0);
        int currentMaxLen = 1;
        for (int k = 1; k < list.size(); k++) {
            int e = list.get(k);
            startNum = startNum + 1;
            if ( e == startNum) {
                currentMaxLen = currentMaxLen + 1;
            } else {
                if (currentMaxLen > targetLen) {
                    targetLen = currentMaxLen;
                }
                startNum = list.get(k);
                currentMaxLen = 1;
                System.out.println(startNum);
            }
            if(k == list.size()-1){
                if (currentMaxLen > targetLen) {
                    targetLen = currentMaxLen;
                }
            }
        }
        System.out.println(targetLen);
    }
}