区间字符串生成

最新推荐文章于 2024-04-15 19:58:13 发布

#朱松涛

最新推荐文章于 2024-04-15 19:58:13 发布

阅读量127

点赞数

文章标签： java

本文链接：https://blog.csdn.net/qq_42860724/article/details/118892156

版权

------------------------------------------Controller

/**
 * @param section 区间字符串
 * @description 费率区间生成
 */
@ApiOperation("区间生成")
@PostMapping(value = "/getSection")
public R getSection(@RequestBody String[] section) {
    return productService.getSection(section);
}

-----------------------------------------Service

/**
 * 费率区间生成
 * @param section 区间字符串
 */
R getSection(String[] section);

-------------------------------------------ServiceImpl

 /**
 * @param section 区间字符串
 * @description 费率区间生成
 * @return: R
 */
@Override
public R getSection(String[] section) {
    List<ProductRateDetailInfoVO> list = new ArrayList<>();

    for (String s : section) {
        if (!ReUtil.isMatch("^[1-9]\\d*$", s)) {
            return R.warning("请输入正整数,不可包含特殊字符");
        }
    }
    for (int i = 0; i < section.length - 1; i++) {
        if (Long.parseLong(section[i]) >= Long.parseLong(section[i + 1])) {
            return R.warning("区间格式错误，应从小到大排序");
        }
    }

    ProductRateDetailInfoVO pmsFeeRateDetail = new ProductRateDetailInfoVO();
    // 序号
    pmsFeeRateDetail.setSeq(1);
    // 区间下限
    pmsFeeRateDetail.setMin(0L);
    // 区间上限
    pmsFeeRateDetail.setMax(Long.parseLong(section[0]));
    pmsFeeRateDetail.setSection("M<" + Long.parseLong(section[0]));
    list.add(pmsFeeRateDetail);
    for (int i = 1; i < section.length; i++) {
        ProductRateDetailInfoVO feeRateDetail = new ProductRateDetailInfoVO();
        // 序号
        feeRateDetail.setSeq(i + 1);
        // 区间下限
        feeRateDetail.setMin(Long.parseLong(section[i - 1]));
        // 区间上限
        feeRateDetail.setMax(Long.parseLong(section[i]));
        feeRateDetail.setSection(section[i - 1] + "<=M<" + section[i]);
        list.add(feeRateDetail);
    }
    ProductRateDetailInfoVO productRateDetailEnd = new ProductRateDetailInfoVO();
    productRateDetailEnd.setSeq(section.length + 1);
    // 无限大的数据
    productRateDetailEnd.setMin(999999999L);
    productRateDetailEnd.setMax(Long.parseLong(section[section.length - 1]));
    productRateDetailEnd.setSection(section[section.length - 1] + "<=M");
    list.add(productRateDetailEnd);
    return R.ok().data(list);
}