java将一个有序数组按是否连续进行分组

代码:

import java.util.Arrays;
import java.util.Comparator;
import java.util.List;

/**
 * @author liyinlong
 * @since 2022/8/22 9:45 上午
 */
public class SemTest {
    
    public static void main(String[] args) {
        List<Integer> list = Arrays.asList(1, 5, 8,3, 10, 11, 19,  9,  13, 4,14);
        list.sort(Comparator.comparing(Integer::intValue));

        String convert = convert(list);
        System.out.println(convert);


    }

    public static String convert(List<Integer> list) {
        int state = 0;
        String result = "";
        for (int i = 0; i < list.size(); i++) {
            if (i == list.size() - 1) {
                state = 2;
            }
            if (state == 0) {
                if (list.get(i + 1) == list.get(i) + 1) {
                    result += Integer.toString(list.get(i));
                    result += "-";
                    state = 1;
                } else {
                    result += Integer.toString(list.get(i));
                    result += ",";
                }
            } else if (state == 1) {
                if (list.get(i + 1) != list.get(i) + 1) {
                    result += Integer.toString(list.get(i));
                    result += ",";
                    state = 0;
                } else {
                    result += list.get(i) + "-";
                }
            } else {
                result += Integer.toString(list.get(i));
            }
        }
        String[] str = result.split(",");

        StringBuffer sbf = new StringBuffer();
        for (int stritem = 0; stritem < str.length; stritem++) {
            String[] sp = str[stritem].split("-");
            List<String> tt = Arrays.asList(sp);
            if(tt.size() == 1){
                sbf.append(Arrays.toString(tt.toArray()));
            }else{
                sbf.append("[" + tt.get(0) + "—" + tt.get(tt.size()-1) + "]");
            }
            if(stritem != str.length-1){
                sbf.append(",");
            }
        }
        return sbf.toString();
    }

}

运行结果:

 

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值