根据输入的数字，对树形数组进行级数筛选

1.实现树形数组中每一级的子元素按照级数进行筛选。如果级数输入为2，则返回每个元素只包含两级，如果输入3则返回每个元素只包含3级
思路：根据传入的级数进行递归

function filterTree(tree, level) {
   if (level <= 1) {
         let tree1 = deepClone(tree));
         for (let i = 0; i < tree1.length; i++) {
             let obj = tree1[i];
             if (obj.hasOwnProperty('children')) {
                 delete obj.children;
             }
         }
         return tree1;
     }

     return tree.map(item => {
         return {
             ...item,
             children: filterTree(item.children, level - 1)
         };
     });
 }
function deepClone(org, target){
    let isArraryStr = '[Object Array]';
    let stringCall = Object.prototype.toString;
    for(let key in org){
        if(org.hasOwnproperty(key)){
            if(typeof org[key] == 'object' && typeof org[key] !== null){
                target[key] = stringCall.call(org[key]) === isArraryStr ? [] : {};
                deepClone(org[key], target[key]);
            } else {
                target[key] = org[key];
            }
        }
    }
}
    

2.查找数组中最后一个符合条件的项

function findLast(arr, callback){
	for(let i = arr.length - 1; i >=0; i--){
			if(callback(arr[i)){
			return arr[i]
			}
	}
	return -1;
}
 var arr = [1, 23, 4, 68,49, 69, 59];
let res = findLast(arr, (item) => item > 60);