深海的算法探索_多序列合并去重

最近做项目写的,可以复用

                /*
                 *作者:赵星海
                 *时间:2020/5/27 15:44
                 *用途: 多序列合并去重
                 */
                if (leftlist == null || leftlist.size() == 0) return;
                HashSet<String> set = new HashSet<>();
                List<OrderDetailsBean.DetailTagRelasBean> okList = new ArrayList<>();
                for (int j = 0; j < leftlist.size(); j++) {
                    GoodsInfosBean goodsBean = leftlist.get(0);
                    List<OrderDetailsBean.DetailTagRelasBean> ExList = goodsBean.getExtendTagDtoList();
                    if (ExList != null && ExList.size() != 0) {
                        for (int i = 0; i < ExList.size(); i++) {
                            if (set.add(ExList.get(i).getTagId())) {//去重
                                okList.add(ExList.get(i));
                            }
                        }
                    }
                }

猜你喜欢

转载自blog.csdn.net/qq_39731011/article/details/106383360
今日推荐