【LC】6188.按身高排序其他解

庞传奇

已于 2022-09-26 07:51:37 修改

阅读量225

点赞数

分类专栏： Java LeetCode题解笔记文章标签：算法开发语言

于 2022-09-26 07:50:50 首次发布

本文链接：https://blog.csdn.net/Chuanqi_Pang/article/details/127046460

版权

Java 同时被 3 个专栏收录

30 篇文章 0 订阅

订阅专栏

LeetCode题解

27 篇文章 0 订阅

订阅专栏

笔记

4 篇文章 0 订阅

订阅专栏

解一:

class Info {
        String name;
        int height;
        
        Info(String name, int height) {
            this.name = name;
            this.height = height;
        }
    }
    
    public String[] sortPeople(String[] names, int[] heights) {
        int n = names.length;
        List<Info> list = new ArrayList<>(n);
        for (int i = 0; i < n; i++) {
            list.add(new Info(names[i], heights[i]));
        }
        list.sort((a, b) -> b.height - a.height);
        String[] ans = new String[n];
        for (int i = 0; i < n; i++) {
            ans[i] = list.get(i).name;
        }
        return ans;
    }

解二：

public String[] sortPeople(String[] names, int[] heights) {
        int n = names.length;
        String[] ans = new String[n];
        List<String> nameList = new ArrayList<String>();
        for (int i = 0; i < n; i++) {
            nameList.add(names[i] + "--" + heights[i]);
        }
        Collections.sort(nameList, (a, b) -> {
            return Integer.parseInt(b.split("--")[1]) - Integer.parseInt(a.split("--")[1]);
        });
        for (int i = 0; i < n; i++) {
            ans[i] = nameList.get(i).split("--")[0];
        }
        return ans;
    }