• 矩阵数据_树数据结构

    文章目录

    1、前言

    1. 我不确定是否是矩阵数据, 烦请各位留言指正. 但该数据的处理方案自我觉得确实可以记录为一篇博客

    2. 矩阵数据 转换为 树数据结构

    3. 代码地址: https://gitee.com/xmaxm/test-code/tree/master/chaim-special-data/src/main/java/com/chaim/special/data/matrix

    2、预处理数据

    1. 多个json数组
    2. 不确定的: key, value, sort值不固定, 数组长度不固定
    3. 确定的: json数组的key值固定, sort值固定. 第一个json数组sort=1, key=充值类型, 第二个json数组sort=1, key=充值类型
    [{"key":"充值类型","sort":1,"value":"铂金会员"},{"key":"时间","sort":2,"value":"3个月"},{"key":"套餐","sort":3,"value":"赠送QQ会员"}],
[{"key":"充值类型","sort":1,"value":"钻石会员"},{"key":"时间","sort":2,"value":"3个月"},{"key":"套餐","sort":3,"value":"赠送网易会员"}],
[{"key":"充值类型","sort":1,"value":"铂金会员"},{"key":"时间","sort":2,"value":"3个月"},{"key":"套餐","sort":3,"value":"赠送腾讯会员"}],
[{"key":"充值类型","sort":1,"value":"铂金会员"},{"key":"时间","sort":2,"value":"3个月"},{"key":"套餐","sort":3,"value":"赠送京东会员"}],
[{"key":"充值类型","sort":1,"value":"铂金会员"},{"key":"时间","sort":2,"value":"4个月"},{"key":"套餐","sort":3,"value":"赠送酷狗会员"}],
[{"key":"充值类型","sort":1,"value":"铂金会员"},{"key":"时间","sort":2,"value":"2个月"},{"key":"套餐","sort":3,"value":"赠送微信会员"}],
[{"key":"充值类型","sort":1,"value":"钻石会员"},{"key":"时间","sort":2,"value":"3个月"},{"key":"套餐","sort":3,"value":"赠送腾讯会员"}],
[{"key":"充值类型","sort":1,"value":"钻石会员"},{"key":"时间","sort":2,"value":"2个月"},{"key":"套餐","sort":3,"value":"赠送微信会员"}]

    • 1
    • 2
    • 3
    • 4
    • 5
    • 6
    • 7
    • 8

    3、期望得到数据结构

    1. 转换为树数据结构
    2. (sort排序, value相同的去重, 对应的 sort+1 数据做子数据, 子数据绑定对应的父级) 循环该操作, 直至所有数据处理完毕
    [{
	"mark": "充值类型",
	"name": "铂金会员",
	"saleAttributeVOList": [{
		"mark": "时间",
		"name": "3个月",
		"saleAttributeVOList": [{
			"mark": "套餐",
			"name": "赠送QQ会员",
			"sort": 3
		}, {
			"mark": "套餐",
			"name": "赠送腾讯会员",
			"saleAttributeVOList": [],
			"sort": 3
		}, {
			"mark": "套餐",
			"name": "赠送京东会员",
			"saleAttributeVOList": [],
			"sort": 3
		}],
		"sort": 2
	}, {
		"mark": "时间",
		"name": "4个月",
		"saleAttributeVOList": [{
			"mark": "套餐",
			"name": "赠送酷狗会员",
			"saleAttributeVOList": [],
			"sort": 3
		}],
		"sort": 2
	}, {
		"mark": "时间",
		"name": "2个月",
		"saleAttributeVOList": [{
			"mark": "套餐",
			"name": "赠送微信会员",
			"saleAttributeVOList": [],
			"sort": 3
		}],
		"sort": 2
	}],
	"sort": 1
}, {
	"mark": "充值类型",
	"name": "钻石会员",
	"saleAttributeVOList": [{
		"mark": "时间",
		"name": "3个月",
		"saleAttributeVOList": [{
			"mark": "套餐",
			"name": "赠送网易会员",
			"sort": 3
		}, {
			"mark": "套餐",
			"name": "赠送腾讯会员",
			"saleAttributeVOList": [],
			"sort": 3
		}],
		"sort": 2
	}, {
		"mark": "时间",
		"name": "2个月",
		"saleAttributeVOList": [{
			"mark": "套餐",
			"name": "赠送微信会员",
			"saleAttributeVOList": [],
			"sort": 3
		}],
		"sort": 2
	}],
	"sort": 1
}]

    • 1
    • 2
    • 3
    • 4
    • 5
    • 6
    • 7
    • 8
    • 9
    • 10
    • 11
    • 12
    • 13
    • 14
    • 15
    • 16
    • 17
    • 18
    • 19
    • 20
    • 21
    • 22
    • 23
    • 24
    • 25
    • 26
    • 27
    • 28
    • 29
    • 30
    • 31
    • 32
    • 33
    • 34
    • 35
    • 36
    • 37
    • 38
    • 39
    • 40
    • 41
    • 42
    • 43
    • 44
    • 45
    • 46
    • 47
    • 48
    • 49
    • 50
    • 51
    • 52
    • 53
    • 54
    • 55
    • 56
    • 57
    • 58
    • 59
    • 60
    • 61
    • 62
    • 63
    • 64
    • 65
    • 66
    • 67
    • 68
    • 69
    • 70
    • 71
    • 72
    • 73
    • 74

    4、几个难点

    1. 如何将这个未知数据处理完毕
    2. 如何获取上一级数据
    3. 如何获取下一级数据
    4. 如何赋值给上一级

    5、示列代码

    1. 示列数据可至博客地址获取, 贴上来太长了:https://gitee.com/xmaxm/test-code/blob/master/chaim-special-data/src/main/java/com/chaim/chaimspecialdata/matrix/MatrixData.java
    package com.chaim.chaimspecialdata.matrix;

import com.alibaba.fastjson.JSONObject;

import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;

//@formatter:off
/**
 * 处理矩阵数据
 *
 * 源数据(key, value不固定, 规格不固定, 可能更多):
 *      [{"key":"充值类型","sort":1,"value":"铂金会员"},{"key":"时间","sort":2,"value":"3个月"},{"key":"套餐","sort":3,"value":"赠送QQ会员"}],
 *      [{"key":"充值类型","sort":1,"value":"钻石会员"},{"key":"时间","sort":2,"value":"3个月"},{"key":"套餐","sort":3,"value":"赠送网易会员"}],
 *      [{"key":"充值类型","sort":1,"value":"铂金会员"},{"key":"时间","sort":2,"value":"3个月"},{"key":"套餐","sort":3,"value":"赠送腾讯会员"}],
 *      [{"key":"充值类型","sort":1,"value":"铂金会员"},{"key":"时间","sort":2,"value":"3个月"},{"key":"套餐","sort":3,"value":"赠送京东会员"}],
 *      [{"key":"充值类型","sort":1,"value":"铂金会员"},{"key":"时间","sort":2,"value":"4个月"},{"key":"套餐","sort":3,"value":"赠送酷狗会员"}],
 *      [{"key":"充值类型","sort":1,"value":"铂金会员"},{"key":"时间","sort":2,"value":"2个月"},{"key":"套餐","sort":3,"value":"赠送微信会员"}],
 *      [{"key":"充值类型","sort":1,"value":"钻石会员"},{"key":"时间","sort":2,"value":"3个月"},{"key":"套餐","sort":3,"value":"赠送腾讯会员"}],
 *      [{"key":"充值类型","sort":1,"value":"钻石会员"},{"key":"时间","sort":2,"value":"2个月"},{"key":"套餐","sort":3,"value":"赠送微信会员"}]
 *
 * 期望类型(sort相同进行过滤去重, 子集做子数据, 已树形结构展示):
 *      [
 *      {"mark":"充值类型","name":"铂金会员","saleAttributeVOList":[
 *              {"mark":"时间","name":"3个月","saleAttributeVOList":[
 *                      {"mark":"套餐","name":"赠送QQ会员","sort":3},
 *                      {"mark":"套餐","name":"赠送腾讯会员","sort":3},
 *                      {"mark":"套餐","name":"赠送京东会员","sort":3}
 *              ],"sort":2},
 *              {"mark":"时间","name":"4个月","saleAttributeVOList":[
 *                      {"mark":"套餐","name":"赠送酷狗会员","sort":3}
 *               ],"sort":2},
 *              {"mark":"时间","name":"2个月","saleAttributeVOList":[
 *                      {"mark":"套餐","name":"赠送微信会员","sort":3}],"sort":2}
 *              ],"sort":1},
 *       {"mark":"充值类型","name":"钻石会员","saleAttributeVOList":[
 *             {"mark":"时间","name":"3个月","saleAttributeVOList":[
 *                      {"mark":"套餐","name":"赠送网易会员","sort":3},
 *                      {"mark":"套餐","name":"赠送腾讯会员","sort":3}
 *             ],"sort":2},
 *             {"mark":"时间","name":"2个月","saleAttributeVOList":[
 *                      {"mark":"套餐","name":"赠送微信会员","sort":3}],"sort":2}
 *             ],"sort":1}
 *     ]
 *
 * @author Chaim
 * @date 2022/7/30 23:36
 * @Description
 */
public class MatrixData {
    /**
     * 几个点:
     *      1. 如何将这个未知数据处理完毕
     *      2. 如何获取上一级数据
     *      3. 如何赋值给上一级
     *      4. 注释(saleAttributeVO != null)内外的没有联系, 大致逻辑差不多可以参考
     * 处理逻辑
     * 注释逻辑为列: [{"key":"充值类型","sort":1,"value":"铂金会员"},{"key":"时间","sort":2,"value":"3个月"},{"key":"套餐","sort":3,"value":"赠送QQ会员"}]
     *
     * @param args
     */
//@formatter:on
    public static void main(String[] args) {
        // 模拟数据
        List<SaleAttributeBO> saleAttributeBOList = getData();

        // 最终类型
        List<SaleAttributeVO> resultList = new ArrayList<>();
        for (SaleAttributeBO saleAttributeBO : saleAttributeBOList) {
            // 待处理数据
            List<SaleAttributeBO.SaleAttribute> saleAttributeList = saleAttributeBO.getSaleAttributeBO();
            saleAttributeList.sort(Comparator.comparing(SaleAttributeBO.SaleAttribute::getSort));

            // 待处理数据第一条. 第一条数据的处理方式会不一样, 他会涉及到一个类似初始化的过程    ({"key":"充值类型","sort":1,"value":"铂金会员"})
            SaleAttributeBO.SaleAttribute saleAttribute = saleAttributeList.get(0);
            // 第一条的数据值  ("value":"铂金会员")
            String value = saleAttribute.getValue();
            // 判断第一条数据值是否已经初始化过, 或者返回数据中是否已经记录了该数据, 存在就忽略该数据
            SaleAttributeVO saleAttributeVO = resultList.stream().filter(versionVO -> value.equals(versionVO.getName())).findAny().orElse(null);
            if (saleAttributeVO != null) {
                // 开始处理子数据, 从第二个数据开始处理
                for (int i = 1; i < saleAttributeList.size(); i++) {
                    // 当前待处理数据. 比如当前待处理数据 ({"key":"套餐","sort":3,"value":"赠送QQ会员"})
                    SaleAttributeVO recursion = getRecursion(saleAttributeList.get(i));
                    // 初始化: 初始化数据的第一层数据. 递归赋值当前数据上层数据 (while之后的数据{"mark": "时间", "name": "3个月", "saleAttributeVOList": []})
                    List<SaleAttributeVO> saleAttributeVOList = saleAttributeVO.getSaleAttributeVOList();
                    // while结束条件, 做递归操作, 一直获取最低程的子数据
                    int j = i;
                    // 获取上一层数据的条件
                    int n = 1;
                    // 下面初始化数据有注释
                    while (j > 1) {
                        // 当前待处理数据的上一层数据, ({"key":"时间","sort":2,"value":"3个月"})
                        SaleAttributeVO recursionReturn = getRecursion(saleAttributeList.get(n));
                        // 判断待处理的上一层数据是否已经在树中存在
                        SaleAttributeVO versionVO = saleAttributeVOList.stream().filter(vo -> recursionReturn.getName().equals(vo.getName())).findAny().orElse(null);
                        // null的情况不需要处理, 因为你的数据不可能存在: 一级二级三级数据中没有二级数据的情况
                        if (versionVO != null) {
                            // 存在就将上一层的数据的子级数据重新赋值给 saleAttributeVOList , 只有这样才能处理如何获取上一级数据, 并做赋值操作
                            saleAttributeVOList = versionVO.getSaleAttributeVOList();
                        }
                        j--;
                        n++;
                    }

                    // 判断当前待处理数据是否存在子级数据中, 不存在就做子级数据赋值
                    SaleAttributeVO versionVO = saleAttributeVOList.stream().filter(vo -> recursion.getName().equals(vo.getName())).findAny().orElse(null);
                    if (versionVO == null) {
                        // 用于处理子级数据为null导致空指针
                        recursion.setSaleAttributeVOList(new ArrayList<>());
                        saleAttributeVOList.add(recursion);
                    }
                }
                continue;
            }

            // 初始化数据
            SaleAttributeVO attributeVO = new SaleAttributeVO();
            attributeVO.setSort(saleAttribute.getSort());
            attributeVO.setMark(saleAttribute.getKey());
            attributeVO.setName(saleAttribute.getValue());
            // 处理的第一条数据没有初始化过, 证明该数据的子集都可以直接做成子数据
            for (int i = 1; i < saleAttributeList.size(); i++) {
                // 待处理子数据
                SaleAttributeVO recursionReturn = getRecursion(saleAttributeList.get(i));
                List<SaleAttributeVO> saleAttributeArrayList = new ArrayList<>();
                // 第一条数据的子数据赋值, 用于递归处理
                // 注: attributeVO该值是已经持久化到attributeVO, 136行
                SaleAttributeVO versionVO = attributeVO;
                // while结束条件, 做递归操作, 一直获取最低程的子数据
                int j = i;
                // j = i; j > 1.
                // 我们需要的是一个树形数据, 列:
                // 当j=1时, recursionReturn是第一层数据("key":"时间"), 故while条件不成立, 可直接赋值给父级, 做树二级
                // 当j=2时, j--; while最终是执行一次, recursionReturn是第二层数据("key":"套餐"), 获取的上一级数据是第二层("key":"时间"), 做树三级
                while (j > 1) {
                    // 获取上一条数据的子集, 从新赋值,
                    // 初始化数据所以都是get(0)
                    versionVO = versionVO.getSaleAttributeVOList().get(0);
                    j--;
                }
                // 子数据加入父级
                saleAttributeArrayList.add(recursionReturn);
                versionVO.setSaleAttributeVOList(saleAttributeArrayList);
            }
            resultList.add(attributeVO);
        }
        System.out.println(JSONObject.toJSONString(resultList));
    }

    /**
     * 装换数据
     *
     * @param saleAttributeBO
     * @return
     */
    public static SaleAttributeVO getRecursion(SaleAttributeBO.SaleAttribute saleAttributeBO) {
        SaleAttributeVO vo = new SaleAttributeVO();
        vo.setMark(saleAttributeBO.getKey());
        vo.setName(saleAttributeBO.getValue());
        vo.setSort(saleAttributeBO.getSort());
        return vo;
    }

    /**
     * 生成模拟数据
     *
     * @return
     */
    public static List<SaleAttributeBO> getData() {
        List<SaleAttributeBO> skuStockClientVOList = new ArrayList<>();

        /**
         * 贴上来太长了, 而且这个示列数据也不重要
         * 示列数据可至博客地址获取:
         * https://gitee.com/xmaxm/test-code/tree/master/chaim-special-data/src/main/java/com/chaim/special/data/matrix
         */
        SaleAttributeBO saleAttributeBO8 = new SaleAttributeBO();
        List<SaleAttributeBO.SaleAttribute> attributeArrayList8 = new ArrayList<>();
        SaleAttributeBO.SaleAttribute saleAttributeEight = new SaleAttributeBO.SaleAttribute();
        saleAttributeEight.setKey("充值类型");
        saleAttributeEight.setValue("钻石会员");
        saleAttributeEight.setSort(1);
        attributeArrayList8.add(saleAttributeEight);
        SaleAttributeBO.SaleAttribute saleAttributeEight2 = new SaleAttributeBO.SaleAttribute();
        saleAttributeEight2.setKey("时间");
        saleAttributeEight2.setValue("2个月");
        saleAttributeEight2.setSort(2);
        attributeArrayList8.add(saleAttributeEight2);
        SaleAttributeBO.SaleAttribute saleAttributeEight3 = new SaleAttributeBO.SaleAttribute();
        saleAttributeEight3.setKey("套餐");
        saleAttributeEight3.setValue("赠送微信会员");
        saleAttributeEight3.setSort(3);
        attributeArrayList8.add(saleAttributeEight3);
        SaleAttributeBO.SaleAttribute saleAttributeEight4 = new SaleAttributeBO.SaleAttribute();
        saleAttributeEight4.setKey("爆率");
        saleAttributeEight4.setValue("30%");
        saleAttributeEight4.setSort(4);
        attributeArrayList8.add(saleAttributeEight4);
        SaleAttributeBO.SaleAttribute saleAttributeEight5 = new SaleAttributeBO.SaleAttribute();
        saleAttributeEight5.setKey("武器类型");
        saleAttributeEight5.setValue("传奇");
        saleAttributeEight5.setSort(5);
        attributeArrayList8.add(saleAttributeEight5);
        saleAttributeBO8.setSaleAttributeBO(attributeArrayList8);

        skuStockClientVOList.add(saleAttributeBO);
        skuStockClientVOList.add(saleAttributeBO2);
        skuStockClientVOList.add(saleAttributeBO3);
        skuStockClientVOList.add(saleAttributeBO4);
        skuStockClientVOList.add(saleAttributeBO5);
        skuStockClientVOList.add(saleAttributeBO6);
        skuStockClientVOList.add(saleAttributeBO7);
        skuStockClientVOList.add(saleAttributeBO8);

        return skuStockClientVOList;
    }
}


    • 1
    • 2
    • 3
    • 4
    • 5
    • 6
    • 7
    • 8
    • 9
    • 10
    • 11
    • 12
    • 13
    • 14
    • 15
    • 16
    • 17
    • 18
    • 19
    • 20
    • 21
    • 22
    • 23
    • 24
    • 25
    • 26
    • 27
    • 28
    • 29
    • 30
    • 31
    • 32
    • 33
    • 34
    • 35
    • 36
    • 37
    • 38
    • 39
    • 40
    • 41
    • 42
    • 43
    • 44
    • 45
    • 46
    • 47
    • 48
    • 49
    • 50
    • 51
    • 52
    • 53
    • 54
    • 55
    • 56
    • 57
    • 58
    • 59
    • 60
    • 61
    • 62
    • 63
    • 64
    • 65
    • 66
    • 67
    • 68
    • 69
    • 70
    • 71
    • 72
    • 73
    • 74
    • 75
    • 76
    • 77
    • 78
    • 79
    • 80
    • 81
    • 82
    • 83
    • 84
    • 85
    • 86
    • 87
    • 88
    • 89
    • 90
    • 91
    • 92
    • 93
    • 94
    • 95
    • 96
    • 97
    • 98
    • 99
    • 100
    • 101
    • 102
    • 103
    • 104
    • 105
    • 106
    • 107
    • 108
    • 109
    • 110
    • 111
    • 112
    • 113
    • 114
    • 115
    • 116
    • 117
    • 118
    • 119
    • 120
    • 121
    • 122
    • 123
    • 124
    • 125
    • 126
    • 127
    • 128
    • 129
    • 130
    • 131
    • 132
    • 133
    • 134
    • 135
    • 136
    • 137
    • 138
    • 139
    • 140
    • 141
    • 142
    • 143
    • 144
    • 145
    • 146
    • 147
    • 148
    • 149
    • 150
    • 151
    • 152
    • 153
    • 154
    • 155
    • 156
    • 157
    • 158
    • 159
    • 160
    • 161
    • 162
    • 163
    • 164
    • 165
    • 166
    • 167
    • 168
    • 169
    • 170
    • 171
    • 172
    • 173
    • 174
    • 175
    • 176
    • 177
    • 178
    • 179
    • 180
    • 181
    • 182
    • 183
    • 184
    • 185
    • 186
    • 187
    • 188
    • 189
    • 190
    • 191
    • 192
    • 193
    • 194
    • 195
    • 196
    • 197
    • 198
    • 199
    • 200
    • 201
    • 202
    • 203
    • 204
    • 205
    • 206
    • 207
    • 208
    • 209
    • 210
    • 211
    • 212
    • 213
    • 214
    • 215
    • 216
    • 217
    • 218
    • 219
    • 220

    6、备注

    1. 处理起来可能还是稍微有点点复杂, 需要对数据整体的结构有一个很清晰的认知
    2. 如果只是处理两层, 三层, 或者说固定长度数据, 到确实简单, 但是当其长度不确定的时候, 就会稍微复杂一些了
    3. 可能对对象的赋值, 内存结构有了更深的认知吧
  • 相关阅读:
    js逆向基础篇-某电商网站-xx街
    Linux项目自动化构建工具-make/Makefile
    常用的思维工具
    2023年【广东省安全员A证第四批（主要负责人）】考试试卷及广东省安全员A证第四批（主要负责人）模拟考试
    mongodb（快速上手）（一）
    细说react源码中的合成事件
    游戏后端服务器架构中的Redis应用：缓存游戏角色、排行榜：玩家分数、计分器：玩家击杀怪物的次数
    【LeetCode热题100】--347.前K个高频元素
    Mac 安装php多版本,brew安装php8.0
    MySQL学习——触发器的语法和示例
  • 原文地址：https://blog.csdn.net/qq_38637558/article/details/126131951