HJ101 输入整型数组和排序标识，对其元素按照升序或降序进行排序

布满荆棘的人生 2024-03-27 16:17 74阅读 0赞

> [牛客华为机试题库【题号 HJ开头】（重点看）][HJ]  
> [牛客在线编程算法篇【题号NC开头】][NC]  
> [剑指offer【题号 JZ开头】][offer_ JZ]  
> [力扣][Link 1]

### 1）[原题链接][Link 2] ###

### 2）已有题解 ###

### 3）代码 ###

package string;
    
    import java.io.BufferedReader;
    import java.io.IOException;
    import java.io.InputStreamReader;
    import java.util.Arrays;
    import java.util.List;
    import java.util.stream.Collectors;
    
    import static java.lang.Integer.parseInt;
    import static java.lang.System.in;
    
    /**
     * HJ101 输入整型数组和排序标识，对其元素按照升序或降序进行排序
     */
    public class HJ101Input0Or1ToOrder {
        
        public static void main(String[] args) throws IOException {
        
            BufferedReader bf = new BufferedReader(new InputStreamReader(in));
            int num = parseInt(bf.readLine());
            List<Integer> collect = Arrays.stream(bf.readLine().split(" ")).limit(num).map(Integer::parseInt).collect(Collectors.toList());
            String order = bf.readLine();
            bf.close();
    
            List<Integer> res = collect.stream().sorted((a, b) -> {
        
                if ("0".equals(order)) {
        
                    return a - b;
                } else {
        
                    return b - a;
                }
            }).collect(Collectors.toList());
    
            String resStr = res.stream().map(String::valueOf).collect(Collectors.joining(" "));
            System.out.println(resStr);
        }
    }

[HJ]: https://www.nowcoder.com/exam/oj/ta?tpId=37
[NC]: https://www.nowcoder.com/exam/oj
[offer_ JZ]: https://www.nowcoder.com/exam/oj/ta?page=1&tpId=13&type=13
[Link 1]: https://leetcode.cn/problemset/all/
[Link 2]: https://www.nowcoder.com/practice/dd0c6b26c9e541f5b935047ff4156309?tpId=37&tqId=21324&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=/exam/oj/ta?page=1&pageSize=100&search=&tpId=37&type=37&difficulty=undefined&judgeStatus=undefined&tags=&title=