java中通过递归获取树形json数据中所有匹配子节点

1.首先获取需要匹配的角色菜单数据

    //获取所有角色拥有的菜单权限数据
        List<RoleOperatorPermission> roleOperatorPermission =  permissionService.findRoleOperatorPermission(employee.getRoleId());

2.获取最外层数组数据示例数据data:[{name:“id”,children:“children:”“”},{name:“id1”,children:“children:”“”}]

 JSONArray jsonArray = jsonObject.getJSONArray("data");
                JSONArray newJsonArray = new JSONArray();
                //获取角色第一层级菜单权限
                for (RoleOperatorPermission list : roleOperatorPermission) {
                    for (int i = 0; i < jsonArray.size(); i++) {
                        JSONObject person = jsonArray.getJSONObject(i);
                        if (person.get("name").equals(list.getCode())) {
                            newJsonArray.add(person);
                        }
                    }
                }

通过最外层数据遍历每个节点的子菜单并将遍历的子节点通过Fastjson赋值

 //通过第一层级菜单逐级获取对应子菜单
                    for (int newIndex = 0; newIndex< newJsonArray.size();newIndex++) {
                        if (newJsonArray.getJSONObject(newIndex).get("children") != null && newJsonArray.getJSONObject(newIndex).get("children") instanceof JSONArray && newJsonArray.getJSONObject(newIndex).getJSONArray("children").size() > 0) {
                            JSONArray resultNode = findJsonNode(newJsonArray.getJSONObject(newIndex).getJSONArray("children"),roleOperatorPermission);
                            if (resultNode != null) {
                                newJsonArray.getJSONObject(newIndex).put("children", resultNode);
                            }
                        }
                }

通过递归获取每个节点下的每个匹配的children节点

  /**
     * 递归获取每个children中匹配角色的菜单
     * @param jsonArray
     * @param roleOperatorPermissions
     * @return
     */
    private static JSONArray findJsonNode(JSONArray jsonArray, List<RoleOperatorPermission> roleOperatorPermissions) {
        JSONArray result = new JSONArray();
        for (int i = 0; i < jsonArray.size(); i++) {
            JSONObject object = jsonArray.getJSONObject(i);
            for (int rIndex = 0; rIndex < roleOperatorPermissions.size(); rIndex++) {
                if (object.get("name").equals(roleOperatorPermissions.get(rIndex).getCode())) {
                    result.add(object);
                }
            }
            JSONArray children = object.getJSONArray("children");
            if (children != null && children instanceof JSONArray && children.size() > 0) {
                JSONArray childResult = findJsonNode(children, roleOperatorPermissions);
                if (childResult != null && childResult.size() > 0) {
                    object.put("children",childResult);
                }
            }
        }
        return result.size() > 0 ? result : null;
    }
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
下面是一个 Java 递归反序列化树形 JSON 数据的示例代码: ```java import java.io.IOException; import java.util.ArrayList; import java.util.List; import com.fasterxml.jackson.core.JsonParseException; import com.fasterxml.jackson.databind.JsonMappingException; import com.fasterxml.jackson.databind.JsonNode; import com.fasterxml.jackson.databind.ObjectMapper; public class JsonTreeDeserializer { private static ObjectMapper mapper = new ObjectMapper(); public static void main(String[] args) { String json = "{\"id\":1,\"name\":\"root\",\"children\":[{\"id\":2,\"name\":\"child1\",\"children\":[{\"id\":3,\"name\":\"grandchild1\"},{\"id\":4,\"name\":\"grandchild2\"}]},{\"id\":5,\"name\":\"child2\",\"children\":[{\"id\":6,\"name\":\"grandchild3\"},{\"id\":7,\"name\":\"grandchild4\"}]}]}"; try { JsonNode rootNode = mapper.readTree(json); Node tree = deserialize(rootNode); System.out.println(tree); } catch (JsonParseException e) { e.printStackTrace(); } catch (JsonMappingException e) { e.printStackTrace(); } catch (IOException e) { e.printStackTrace(); } } public static Node deserialize(JsonNode node) { int id = node.get("id").asInt(); String name = node.get("name").asText(); Node tree = new Node(id, name); JsonNode childrenNode = node.get("children"); if (childrenNode != null && childrenNode.isArray()) { for (JsonNode childNode : childrenNode) { Node child = deserialize(childNode); tree.addChild(child); } } return tree; } } class Node { private int id; private String name; private List<Node> children; public Node(int id, String name) { this.id = id; this.name = name; this.children = new ArrayList<Node>(); } public void addChild(Node node) { this.children.add(node); } @Override public String toString() { return "Node [id=" + id + ", name=" + name + ", children=" + children + "]"; } } ``` 这个示例代码使用了 Jackson 库来进行 JSON 反序列化。首先读取 JSON 数据,然后递归地反序列化每个节点,并构建树形结构。最后输出树形结构。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值