Java中将返回的父子层级数据组装成一条条记录数据

该代码段展示了如何处理一个包含主诉信息的JSON数据集合,这些信息包括不同级别的主诉分类。程序首先解析JSON字符串,然后通过遍历并检查每个主诉的`mainComplaintParentCode`来确定其层级关系。最后,将处理后的数据保存到数据库中。
摘要由CSDN通过智能技术生成

数据是别人返回的,我这边要处理成一条条记录保存到我们库里面,
allChimplaintList和 mapData均为全局变量

思路 : 逆向反推,从子级查父级


    public static void main(String[] args) {
        //解析主诉集合
        String str = "{\n" +
                "  \"code\": 200,\n" +
                "  \"body\": {\n" +
                "    \"resultStatus\": \"success\",\n" +
                "    \"mainComplaint\": [\n" +
                "      {\n" +
                "        \"mainComplaintCode\": \"100\",\n" +
                "        \"mainComplaintId\": \"1\",\n" +
                "        \"mainComplaintParentCode\": \"0\",\n" +
                "        \"mainComplaintName\": \"外伤\"\n" +
                "      },\n" +
                "      {\n" +
                "        \"mainComplaintCode\": \"200\",\n" +
                "        \"mainComplaintId\": \"2\",\n" +
                "        \"mainComplaintParentCode\": \"0\",\n" +
                "        \"mainComplaintName\": \"非外伤\"\n" +
                "      },\n" +
                "      {\n" +
                "        \"mainComplaintCode\": \"300\",\n" +
                "        \"mainComplaintId\": \"3\",\n" +
                "        \"mainComplaintParentCode\": \"0\",\n" +
                "        \"mainComplaintName\": \"儿科\"\n" +
                "      },\n" +
                "      {\n" +
                "        \"mainComplaintCode\": \"100005\",\n" +
                "        \"mainComplaintId\": \"105\",\n" +
                "        \"mainComplaintParentCode\": \"100\",\n" +
                "        \"mainComplaintName\": \"鼻子\"\n" +
                "      },\n" +
                "      {\n" +
                "        \"mainComplaintCode\": \"100005002\",\n" +
                "        \"mainComplaintId\": \"10502\",\n" +
                "        \"mainComplaintParentCode\": \"100005\",\n" +
                "        \"mainComplaintName\": \"鼻子撕裂伤\"\n" +
                "      },\n" +
                "      {\n" +
                "        \"mainComplaintCode\": \"100006001\",\n" +
                "        \"mainComplaintId\": \"10601\",\n" +
                "        \"mainComplaintParentCode\": \"100006\",\n" +
                "        \"mainComplaintName\": \"耳朵钝伤\"\n" +
                "      },\n" +
                "      {\n" +
                "        \"mainComplaintCode\": \"100005001\",\n" +
                "        \"mainComplaintId\": \"10501\",\n" +
                "        \"mainComplaintParentCode\": \"100005\",\n" +
                "        \"mainComplaintName\": \"鼻子钝伤\"\n" +
                "      },\n" +
                "      {\n" +
                "        \"mainComplaintCode\": \"100005001001\",\n" +
                "        \"mainComplaintId\": \"1050101\",\n" +
                "        \"mainComplaintParentCode\": \"100005001\",\n" +
                "        \"mainComplaintName\": \"无法控制的出血\"\n" +
                "      },\n" +
                "      {\n" +
                "        \"mainComplaintCode\": \"200002\",\n" +
                "        \"mainComplaintId\": \"202\",\n" +
                "        \"mainComplaintParentCode\": \"200\",\n" +
                "        \"mainComplaintName\": \"心血管系统\"\n" +
                "      },\n" +
                "      {\n" +
                "        \"mainComplaintCode\": \"200002001\",\n" +
                "        \"mainComplaintId\": \"20201\",\n" +
                "        \"mainComplaintParentCode\": \"200002\",\n" +
                "        \"mainComplaintName\": \"心跳停止(非外伤)\"\n" +
                "      },\n" +
                "      {\n" +
                "        \"mainComplaintCode\": \"200002002\",\n" +
                "        \"mainComplaintId\": \"20202\",\n" +
                "        \"mainComplaintParentCode\": \"200002\",\n" +
                "        \"mainComplaintName\": \"心因性胸痛/胸闷\"\n" +
                "      },\n" +
                "      {\n" +
                "        \"mainComplaintCode\": \"200002002001\",\n" +
                "        \"mainComplaintId\": \"2020201\",\n" +
                "        \"mainComplaintParentCode\": \"200002002\",\n" +
                "        \"mainComplaintName\": \"重度呼吸窘迫\"\n" +
                "      },\n" +
                "      {\n" +
                "        \"mainComplaintCode\": \"200002002002\",\n" +
                "        \"mainComplaintId\": \"2020202\",\n" +
                "        \"mainComplaintParentCode\": \"200002002\",\n" +
                "        \"mainComplaintName\": \"休克\"\n" +
                "      }\n" +
                "    ]\n" +
                "  }\n" +
                "}";
        if (Util.valid(str)) {
            JSONObject result = JSONObject.parseObject(str);
            String bodyStr = result.getString("body");
            if (Util.valid(bodyStr)) {
                JSONObject bodyJson = JSONObject.parseObject(bodyStr);
                String mainComplaint = bodyJson.getString("mainComplaint");
                if (Util.valid(mainComplaint)) {
                    //存放一级节点 分类
                    List<Map<String, String>> firstList = Lists.newArrayList();
                    List<Map<String, String>> fourList = Lists.newArrayList();
                    List<Map> complaintMains = JSONObject.parseArray(mainComplaint, Map.class);
                    //获取一级节点
                    for (Map<String, String> ereryMap : complaintMains) {
                        //查询一级的节点. 分类
                        /*if ("0".equals(ereryMap.get("mainComplaintParentCode"))) {
                            firstList.add(ereryMap);
                        }*/
                        //逆向查找到所有最底层级
                        if(ereryMap.get("mainComplaintCode").length() == 12){
                            fourList.add(ereryMap);
                        }
                    }
                    transformMainComplaint(complaintMains, fourList);
                    for (Map map : allChimplaintList) {
                        //保存到库里面

                    }
//                    System.out.println(JSONObject.toJSONString(allChimplaintList));
                }
            }
        }
    }

    private static void transformMainComplaint(List<Map> itemList, List<Map<String, String>> dataArray) {
        for (int j = 0; j < dataArray.size(); j++) {
            if(dataArray.get(j).get("mainComplaintCode").length()==3){
                allChimplaintList.add(mapData); 
            }
            if(dataArray.get(j).get("mainComplaintCode").length()==12){
                mapData=Maps.newHashMap();
                mapData.put("fourth",dataArray.get(j).get("mainComplaintName"));
                mapData.put("mainComplaintCode",dataArray.get(j).get("mainComplaintCode"));
            }
            List parentArray = Lists.newArrayList();
            for (int i = 0; i < itemList.size(); i++) {
                if (dataArray.get(j).get("mainComplaintParentCode").equals(itemList.get(i).get("mainComplaintCode"))) {//判断是否为儿子节点
                    parentArray.add(itemList.get(i));
                    String level = checkCodeLength(itemList.get(i).get("mainComplaintCode").toString().length());
                    mapData.put(level,itemList.get(i).get("mainComplaintName"));
                   // System.out.println(JSONObject.toJSONString(parentArray));
                }
            }
            if (parentArray.size() > 0) {//有儿子节点则递归
                transformMainComplaint(itemList, parentArray);
            }
        }
    }
    //判断mainComplaintCode长度,第四级长度为12, 第三季长度为9 ,第二级长度为6 ,第一级长度为3
    private static String checkCodeLength(int mainComplaintCode){
        String level="";
        switch (mainComplaintCode){
            case 12:
                level = "fourth"; //第四级
                break;
            case 9:
                level = "third";
                break;
            case 6:
                level = "twice";
                break;
            case 3:
                level = "first";
                break;
            default:
                break;

        }
        return  level;
    }
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值