根据已有条件查询—-补齐数据--并且排序

最新推荐文章于 2022-07-21 11:28:08 发布

weixin_40650583

最新推荐文章于 2022-07-21 11:28:08 发布

阅读量347

点赞数

分类专栏： java 文章标签：补齐数据

本文链接：https://blog.csdn.net/weixin_40650583/article/details/84750155

版权

java 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

Map<String, String> stores,
Set<String> storeIds = stores.keySet();
		for (String integer : storeIds) {
			query.getStoreIds().add(Integer.parseInt(integer));
		}
Map<String, String> storesCopy = new HashMap<String, String>(stores);
if(storePrize!=null){
			for (FanPrizeStoreReport prizeStoreReport : storePrize) {
				storesCopy.remove(prizeStoreReport.getStoreId().toString());
				prizeStoreReport.setStoreName(stores.get(prizeStoreReport.getStoreId().toString()));
	List<FanPrizeStoreReport> storePrize1 = new ArrayList<FanPrizeStoreReport>();
		Set<String> storeIdsCopy = storesCopy.keySet();
		for (String integer : storeIdsCopy) {
			FanPrizeStoreReport prizeStoreReport = new FanPrizeStoreReport();
			prizeStoreReport.setStoreId(Integer.valueOf(integer));
			prizeStoreReport.setStoreName(storesCopy.get(integer));
			storePrize1.add(prizeStoreReport);
		}
		prize.setStores(storePrize1);
		Collections.sort(prize.getStores(), new Comparator<FanPrizeStoreReport>() {
			@Override
			public int compare(FanPrizeStoreReport o1, FanPrizeStoreReport o2) {
				return o1.getStoreName().compareTo(o2.getStoreName());
			}
		});
		return prize;
		
	}