正则表达式匹配练习

字符串中第一个出现一次的字符

function find(str){
    for (var i = 0; i < str.length; i++) {
        let char = str[i]
        let reg = new RegExp(char, 'g');
        let l = str.match(reg).length
        if(l===1){
            return char
        }
    }
}

将1234567 变成 1,234,567，即千分位标注

function exchange(num) {
    num += ''; //转成字符串
    if (num.length <= 3) {
        return num;
    }

    num = num.replace(/\d{1,3}(?=(\d{3})+$)/g, (v) => {
        console.log(v)
        return v + ',';
    });
    return num;
}

console.log(exchange(1234567));

或者

function exchange(num) {
	num += '';
	return num.replace(/(?!^)(?=(\d{3})+$)/g, ',');
}

压缩字符串’aaabbcccc’ to ‘a3b2c4’

function zipStr(str) {
	return str.replace(/([a-zA-Z])(\1+)/g, (match, p1) => {
		return match[0] + match.length;
	})
}
console.log(zipStr('aaabbccccd'));
// a3b2c4d

如果单个字符后面需要加上1的话：

function zipStr(str) {
	return str.replace(/([a-zA-Z])(?:(\1+)|(\1?))/g, (match) => {
		return match[0] + match.length;
	})
}
console.log(zipStr('aaabbccccd'));
// a3b2c4d1