一些好用的前端方法

1. 给数额添加 ‘,’ 表示单位

let a = "10000000";
const res = a.replace(/(?=\B(\d{3})+$)/g, ',');
//  10,000,000

2. 前端方法重写 即 相同方法名不同参数执行不同逻辑

        let obj = {};
        function overWrite(object, name, fn) {
            const old = object[name];
            object[name] = function (...args) {
                if (args.length === fn.length) {
                    return fn.apply(this, args)
                } else if (typeof old === 'function') {
                    return old.apply(this, args)
                }
            }
        }

        overWrite(obj, 'find', () => {
            console.log('方法1');
        })
        overWrite(obj, 'find', (name) => {
            console.log('方法2');
        })
        overWrite(obj, 'find', (lastName, firstName) => {
            console.log('方法3');
        })


        obj.find(); // 方法1
        obj.find('lisi'); // 方法2
        obj.find('lisi', 12);// 方法3

3. 字符串自带API 按字典排序

         let cities = ["成都", "北京", "四川", '重庆']

         cities.sort((a, b) => a.localeCompare(b));
         // ['北京', '成都', '重庆', '四川']

4. 随意给定字符串，返回其中没有重复字符最长值

var lengthOfLongestSubstring = function (s) {
            let window = {};
            let left = 0, right = 0;
            let maxLen = 0, maxStr = '';
            while (right < s.length) {
                let c = s[right];
                right++;
                if (window[c]) window[c]++;
                else window[c] = 1
                while (window[c] > 1) {
                    let d = s[left];
                    left++;
                    window[d]--;
                }
                if (maxLen < right - left) {
                    maxLen = right - left;
                }
            }
            return maxLen;
        };
		lengthOfLongestSubstring("1111111223123123456789");
        //9