给定一个字符串,找出其中不含有重复字符的最长子串的长度
例如:
输入: “abcabcbb”
输出: 3
解释: 因为无重复字符的最长子串是 “abc”,所以其长度为 3。
输入: “pwwkew”
输出: 3
解释: 因为无重复字符的最长子串是 “wke”,所以其长度为 3。
finalStr(value) {
//const { templateStr } = this;
const templateStr = value;
let templateArr = [];
for (let i = 0; i < templateStr.length; i += 1) {
const temporaryArr = [];
for (let j = i; j < templateStr.length; j += 1) {
const currentStr = templateStr[j];
if (temporaryArr.includes(currentStr)) {
break;
}
temporaryArr.push(currentStr);
}
if (temporaryArr.length > templateArr.length) {
templateArr = temporaryArr;
}
}
return templateArr.join('').trim();
},
JS实现货币格式化函数
currencyNumber(value) {
const currency = value;
const { intNumber, decNumber } = IntegerDecimalDivision(currency);
const currencyLength = intNumber.length;
let currentArr = [];
let count = 0;
for (let i = currencyLength - 1; i >= 0; i -= 1) {
currentArr.unshift(intNumber[i]);
count += 1;
if (count % 3 === 0 && count !== currencyLength) {
currentArr.unshift(',');
}
}
if (decNumber && decNumber.length !== 0) {
currentArr = currentArr.concat('.', decNumber);
}
return currentArr.join('');
},
IntegerDecimalDivision(val) {
const arr = val.split('.');
return {
intNumber: arr[0],
decNumber: arr[1],
};
},