递归算法

 function f (json,decryptparams,keyvalues){ if(json.length){ for(var i=0;i < json.length; i++){ for(var key in json[i]){if(json[i][key] instanceof Object){f(json[i][key],decryptparams,keyvalues);}else{if(decryptparams.indexOf(key) != -1){//rsa解密json[i][key] = decryptParams(json[i][key]);}keyvalues.push({name: key,value: json[i][key],})} } } }else{ for(var key in json){ if(json[key] instanceof Object){f(json[key],decryptparams,keyvalues); }else{ if(decryptparams.indexOf(key) != -1){//rsa解密 json[key] = decryptParams(json[key]); } keyvalues.push({name: key,value: json[key],}) } } } }