java_从键盘输⼊⼀串字符串,存⼊ArrayList中,再将其 分别按字典序升序排序、按字典序降序排序、 按字符串长度降序排序、先按字符串长度降序排列 再按字典序排序。

package experiment6;

import java.util.*;

/*

输出:
merlot is made the same way as its more famous cousin white zinfandel the grapes are crushed and after very brief or even no skin contact the resulting pink must ferments some producers of white merlot include sutter home forest glen and beringer it normally has a hint of raspberry flavor white merlot was reputedly first marketed in the late one nine nine zero
*/
public class exp1 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("请输入一串字符:");
        String line = sc.nextLine();
        List<String> list = new ArrayList<>();
        String[] tmpStr = line.split(" ");
        // for(int i = 0;i<tmpStr.length;i++)
        for (String x : tmpStr) {
            list.add(x);
        }
        Collections.sort(list, new Comparator<String>() {
            @Override
            public int compare(String o1, String o2) {
                return o1.compareTo(o2);
            }
        });
        System.out.println("按字典序排序");
        System.out.println(list);
        Collections.sort(list, new Comparator<String>() {
            @Override
            public int compare(String o1, String o2) {
                return o2.compareTo(o1);
            }
        });
        System.out.println("按字典序逆序排序");
        System.out.println(list);

        Collections.sort(list, new Comparator<String>() {
            @Override
            public int compare(String o1, String o2) {
                return o2.length() - o1.length();
            }
        });
        System.out.println("按字符串的长度降序排序");
        System.out.println(list);
        //
        Collections.sort(list, new Comparator<String>() {
            @Override
            public int compare(String o1, String o2) {
                if (o1.length() == o2.length()) {
                    return o1.compareTo(o2);
                } else
                    return o2.length() - o1.length();
            }
        });
        System.out.println("先按字符串的长度降序排序再按字典序排序");
        System.out.println(list);
    }
}

  • 0
    点赞
  • 6
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值