求json子节点的最大深度（java递归）

在网上看到一个题目，求json子节点的最大深度，自己用java尝试了一下。

腾讯的一道面试题［https://testerhome.com/topics/17949］

json数据例子如下所示：

{
"ext_meta":{
	"id":4332021940090402,
	"uid":0,
	"similarity":1,
	"blockOid":{
		"id":4332021940090402,
		"uid":0,
		"similarity":"1239545",
		"blockOid":null,
		"blockTopicMd5":null
	},
	"blockTopicMd5":{
		"id":4332021940090402,
		"uid":0,
		"similarity":"1239545",
		"blockOid":{
			"id":4332021940090402,
			"uid":0,
			"similarity":"1239545",
			"blockOid":null,
			"blockTopicMd5":null
			},
		"blockTopicMd5":null
		}
	}, 
"msg":"found",
"ext_meta1":{
	"id":4332021940090402,
	"uid":0,
	"similarity":"1239545",
	"blockOid":null,
	"blockTopicMd5":null
		}
	}

可以看出，深度最大是3，ext_meta->blockTopicMd5->blockOid"
###将字符串定义为JSONObject，采用了递归算法。如果value中没有字符"{"则判断遍历到了最里层。

package test;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import net.sf.json.JSONObject;
public class AProblemDiGui {
    static int count=0;
    public static void main(String[] args) {
        String param="{\"ext_meta\":{\"id\":4332021940090402,\"uid\":0,\"similarity\":1,\"blockOid\":{\"id\":4332021940090402,\"uid\":0,\"similarity\":\"1239545\",\"blockOid\":null,\"blockTopicMd5\":null},\"blockTopicMd5\":{\"id\":4332021940090402,\"uid\":0,\"similarity\":\"1239545\",\"blockOid\":{\"id\":4332021940090402,\"uid\":0,\"similarity\":\"1239545\",\"blockOid\":null,\"blockTopicMd5\":null},\"blockTopicMd5\":null}}, \"msg\":\"found\",\"ext_meta1\":{\"id\":4332021940090402,\"uid\":0,\"similarity\":\"1239545\",\"blockOid\":null,\"blockTopicMd5\":null}}";
        System.out.println(getLength(param));
    }
    static public int getLength(String temp){
        Boolean flag=true;
        JSONObject jsonObject= JSONObject.fromObject(temp);
        Iterator iteratorValue=jsonObject.values().iterator();
        Iterator iteratorKey=jsonObject.keySet().iterator();
        while (iteratorValue.hasNext()){
            String value=iteratorValue.next().toString();
            System.out.println(iteratorKey.next()+":"+value);
            if (value.startsWith("{")){
                if (flag) {  //单层只记录一次
                    count++;
                    flag=false;
                }
                int tmp=getLength(value);
                if (tmp>count)
                    count=tmp;
            }
        }
        return count;
    }
}

返回结果如下：

ext_meta:{"id":4332021940090402,"uid":0,"similarity":1,"blockOid":{"id":4332021940090402,"uid":0,"similarity":"1239545","blockOid":null,"blockTopicMd5":null},"blockTopicMd5":{"id":4332021940090402,"uid":0,"similarity":"1239545","blockOid":{"id":4332021940090402,"uid":0,"similarity":"1239545","blockOid":null,"blockTopicMd5":null},"blockTopicMd5":null}}
id:4332021940090402
uid:0
similarity:1
blockOid:{"id":4332021940090402,"uid":0,"similarity":"1239545","blockOid":null,"blockTopicMd5":null}
id:4332021940090402
uid:0
similarity:1239545
blockOid:null
blockTopicMd5:null
blockTopicMd5:{"id":4332021940090402,"uid":0,"similarity":"1239545","blockOid":{"id":4332021940090402,"uid":0,"similarity":"1239545","blockOid":null,"blockTopicMd5":null},"blockTopicMd5":null}
id:4332021940090402
uid:0
similarity:1239545
blockOid:{"id":4332021940090402,"uid":0,"similarity":"1239545","blockOid":null,"blockTopicMd5":null}
id:4332021940090402
uid:0
similarity:1239545
blockOid:null
blockTopicMd5:null
blockTopicMd5:null
msg:found
ext_meta1:{"id":4332021940090402,"uid":0,"similarity":"1239545","blockOid":null,"blockTopicMd5":null}
id:4332021940090402
uid:0
similarity:1239545
blockOid:null
blockTopicMd5:null
3