java长度排序,Java:按长度排序一个单词列表,然后按字母顺序排列

I am told to have a list of words sorted by length, and those that have the same length are sorted by alphabetical order. This is what I have for the method that does that so far.

public static void doIt(BufferedReader r, PrintWriter w) throws IOException {

TreeMap s = new TreeMap();

ArrayList count = new ArrayList();

String line;

int length;

while ((line = r.readLine()) != null) {

length = line.length();

s.put(line, length);

if (!count.contains(length)){

count.add(length);

}

}

Collections.sort(count);

System.out.println(count);

}

My mindset was to use a TreeMap to keep the String, and the length of the word as the key. I also have an ArrayList that keeps track of all the word's lengths without any duplicates, it's then sorted.

I was hoping to somehow call on the TreeMap for the key value of 5, which would list all the words with 5 letters in it.

I was wondering if I'm on the right track? I've been playing around for over an hour and can't seem to figure out what I should do after this. Am I approaching this from the right angle?

解决方案

The easiest way would be to write a Comparator. The Comparator would receive two words, and compare them. If the first was shorter than the second, it should return -1. If the second was shorter than the first, it would return 1. If they are the same length, it should call the default String compareTo method. You can then simply sort your list using this custom Comparator.

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值