题解 | 组建一支最强篮球队

import java.util.*;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        String test = in.nextLine();

        String[] player = test.split(" ");
        int player_num = player.length;
        int team_num = in.nextInt();

        int[] team = new int[team_num];
        int pos = 0;
        for (int i = 0; i < team_num; i ++) {
            for (int j = 0 + pos; j < player_num - team_num + i + 1; j ++) {
                int cur = 0;
                try {
                    cur = Integer.parseInt(player[j]);
                } catch (Exception e) {
                    System.out.println("error");
                    return;
                }
                if (cur > team[i]){
                    team[i] = Math.max(team[i], cur);
                    pos = j + 1;
                }
            }
        }
        StringBuilder res = new StringBuilder();
        for (int i = 0 ; i < team_num; i ++){
            res.append(team[i]).append(" ");
        }
        System.out.println(res);
    }
}

//System.out.println(a + b);

看似是较难题，其实理清楚之后是简单题，可以用堆栈的思想去解决，然后用一个指针稍微优化一下循环遍历就好了