// 判断是否含有特殊符号
let iconRule1 = /[`~!@#$%^&*()_\-+=<>?:"{}|,.\/;'\\[\]·~！@#￥%……&*（）——\-+={}|《》？：“”【】、；‘’，。、]/im
// 判断是否含有emoji表情
let iconRule2 = /[\uD83C|\uD83D|\uD83E][\uDC00-\uDFFF][\u200D|\uFE0F]|[\uD83C|\uD83D|\uD83E][\uDC00-\uDFFF]|[0-9|*|#]\uFE0F\u20E3|[0-9|#]\u20E3|[\u203C-\u3299]\uFE0F\u200D|[\u203C-\u3299]\uFE0F|[\u2122-\u2B55]|\u303D|[\A9|\AE]\u3030|\uA9|\uAE|\u3030/ig
// 如果为true，字符串含有emoji表情 ，false不含
console.log(iconRule2.test('😺'));   // true 
// 如果为true，字符串含有特殊符号 ，false不含
console.log(iconRule1.test('【】'))   // true

// referenceStr:引用字符串    compareString:比较字符串
referenceStr.localeCompare(compareString[, locales[, options]])

function compare(a, b) {
    return a.localeCompare(b);
}
resultArr = [ '学习' , '钢材' , '蛋汤' , '房企', '安卓','北京', '藏宝' ] ;
resultArr.sort(compare);    // ["安卓", "北京", "藏宝", "蛋汤", "房企", "钢材", "学习"]

// 返回元素的宽度（包括元素宽度、内边距和边框，不包括外边距）
var offsetWidth = element.offsetWidth;

function Rocker(name){
  this.name = name;
};
Rocker.prototype.getName = function(){
  return this.name;
}

var someOne = new Rocker('Max')

var createObject = function(){
  var obj = new Object(),   //(1)
      Constructor = [].shift.call(arguments);   //(2)
  obj.__proto__ = Constructor.prototype;    //(3)
  var ret = Constructor.apply(obj, arguments);    //(4)
  return typeof ret === 'object' ? ret : obj;   //(5)
};
var Freak = createObject(Rocker, 'Freak');
console.log(Freak.name);  //Freak
console.log(Freak.getName());  //Freak
console.log(Object.getPrototypeOf(Freak) === Rocker.prototype); //true

给定 nums = [2, 7, 11, 15], target = 9

因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function (nums, target) {
  const _arr = [];
  for (let i = 0; i < nums.length; i++) {
    for (let j = i + 1; j < nums.length; j++) {
      if (nums[i] + nums[j] === target) {
        _arr.push(i, j);
      }
    }
  }
  return _arr;
};

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function (nums, target) {
  for (let i = 0; i < nums.length; i++) {
    let arrIndex = nums.findIndex(v => v === target - nums[i])
    if (arrIndex !== -1 && arrIndex !== i) {
      return [i, arrIndex]
    }
  }
}

function deep(arr, count = 0, ttt = []) {
    for (let index in arr) {
        if (Array.isArray(arr[index])) {
            count++
            deep(arr[index], count, ttt)
        } else {
            ttt.push(count)
        }
    }

    //return Math.max.apply(null, ttt) + 1
    return Math.max(...ttt) + 1;
}

let arr = [1, 2, 3, ['n', 'i', ['t', ['nihao']]], ['a', 'b']]

console.log(deep(arr)) // 4

const fuck = [{"label": "占用道路问题", "value": 31, "children": [{"label": "经营占道", "value": 35, "children": [{"label": "店外经营占道", "value": 40, "children": null }, {"label": "流动摊贩占道", "value": 41, "children": null } ] }, {"label": "垃圾占道", "value": 36, "children": [{"label": "生活垃圾", "value": 42, "children": null }, {"label": "建筑垃圾", "value": 43, "children": null }, {"label": "工业垃圾", "value": 44, "children": null } ] }, {"label": "车辆占道", "value": 37, "children": [{"label": "机动车占道", "value": 45, "children": null }, {"label": "非机动车占道", "value": 46, "children": null } ] }, {"label": "霸占车位", "value": 38, "children": [] }, {"label": "其他占道", "value": 39, "children": [] } ]}, {"label": "“两违”问题", "value": 32, "children": [{"label": "违法建筑", "value": 58, "children": [{"label": "房屋违建", "value": 61, "children": null }, {"label": "小区违建", "value": 62, "children": null }, {"label": "违建棚架", "value": 63, "children": null } ] }, {"label": "违法用地", "value": 59, "children": [] }, {"label": "其他违建", "value": 60, "children": [] } ] }, {"label": "市容设施管理问题", "value": 33, "children": [{"label": "道路损坏", "value": 47, "children": [] }, {"label": "垃圾桶损坏", "value": 48, "children": [] }, {"label": "下水道堵塞", "value": 49, "children": [] }, {"label": "井盖损坏", "value": 50, "children": [] }, {"label": "路灯损坏", "value": 51, "children": [] }, {"label": "树木修剪", "value": 52, "children": [] }, {"label": "水电气", "value": 53, "children": [] }, {"label": "户外广告牌", "value": 54, "children": [] }, {"label": "隔音屏损坏", "value": 55, "children": [] }, {"label": "洒水车问题", "value": 56, "children": [] }, {"label": "其他", "value": 57, "children": [] } ] }, {"label": "其他问题", "value": 34, "children": [] } ]

/**
 * 深度递归搜索
 * @param {Array} arr 你要搜索的数组
 * @param {Function} condition 回调函数，必须返回谓词，判断是否找到了。会传入(item, index, level)三个参数
 * @param {String} children 子数组的key
 */
const deepFind = (arr, condition, children) => {
    // 即将返回的数组
    let main = []

    // 用try方案方便直接中止所有递归的程序
    try {
        // 开始轮询
        (function poll(arr, level) {
            // 如果传入非数组
            if (!Array.isArray(arr)) return

            // 遍历数组
            for (let i = 0; i < arr.length; i++) {
                // 获取当前项
                const item = arr[i]

                // 先占位预设值
                main[level] = item

                // 检验是否已经找到了
                const isFind = condition && condition(item, i, level) || false

                // 如果已经找到了
                if (isFind) {
                    // 直接抛出错误中断所有轮询
                    throw Error

                // 如果存在children，那么深入递归
                } else if (children && item[children] && item[children].length) {
                    poll(item[children], level + 1)

                // 如果是最后一个且没有找到值，那么通过修改数组长度来删除当前项
                } else if (i === arr.length - 1) {
                   // 删除占位预设值
                   main.length = main.length - 1
                }
            }
        })(arr, 0)
    // 使用try/catch是为了中止所有轮询中的任务
    } catch (err) {}

    // 返回最终数组
    return main
}

let resultArr = deepFind(fuck, (item, index, level) => item.value === 63, 'children');
console.log(resultArr);  // [{…}, {…}, {…}]
console.log(resultArr.map(_ => _.value)); // [32, 58, 63]