原标题:web前端培训:js算法面试es6实现
let str = ' asdfghjklaqwertyuiopiaa ';
const strChar = str => {
让string = [...str],
最大值=“”,
obj = {},
max = 0;
string.forEach(value => {
obj[值]= obj[值] ==未定义?1:对象[值] + 1
if (obj[value] > max) {
max = obj[值]
最大值=值
}
})
返回maxValue
}
console.log(strChar(str)) // a
2.1、外语
设arr = ['1 ',' 2 ',' 3 ',' 1 ',' a ',' b ',' b']
const unique = arr => {
让obj = {}
arr.forEach(value => {
obj[value] = 0
})
返回Object.keys(obj)
}
console.log(unique(arr)) // ['1 ',' 2 ',' 3 ',' a ',' b']
设arr = ['1 ',' 2 ',' 3 ',' 1 ',' a ',' b ',' b']
const unique = arr => {
return arr.filter((ele,index,array) => {
返回index === array.indexOf(ele)
})
}
console.log(unique(arr)) // ['1 ',' 2 ',' 3 ',' a ',' b']
设arr = ['1 ',' 2 ',' 3 ',' 1 ',' a ',' b ',' b']
const unique = arr => {
返回[...新集合(arr)]
}
console.log(unique(arr)) // ['1 ',' 2 ',' 3 ',' a ',' b']
设arr = ['1 ',' 2 ',' 3 ',' 1 ',' a ',' b ',' b']
const unique = arr.reduce((map,item) => {
map[item] = 0
返回地图
}, {})
console . log(object . keys(unique))//[' 1 ',' 2 ',' 3 ',' a ',' b '][关注上思谷,轻松学会]
let str = " Hello Dog
const reverseString = str =>{
返回[...str]。反转()。join(" ");
}
console . log(reverse string(str))//goD olleH
设arr = [23,4,5,2,4,5,6,6,71,-3];
常数差= arr => {
设min = arr[0],
max = 0;
arr.forEach(value => {
if(值<最小值)min =值
if(值>最大值)最大值=值
})
返回max-min;
}
console . log(difference(arr))//74
设arr = [23,4,5,2,4,5,6,6,71,-3];
常数差= arr => {
设max = Math.max(...arr),
min = Math.min(...arr);
返回max-min;
}
console . log(difference(arr))//74
设a = 2,
b = 3;
[b,a] = [a,b]
console.log(a,b) // 3 2
输入a = 2,b = 3,输出a = 3,b = 2
设a = 2,
b = 3;
const swop = (a,b) => {
b = b-a;
a = a+b;
b = a-b;
return [a,b];
}
console.log(swop(2,3)) // [3,2]www.atguigu.com
设a = 2,
b = 3;
const swop = (a,b) => {
a ^= b;//x首先存储x和y的信息。
b ^= a;//保持X不变,用X的XOR对Y的原值求逆,使之等于X的原值。
a ^= b;//保持Y不变,用X异或对Y的原值求逆,使之等于Y的原值【专注尚硅谷,轻松学会】
return [a,b];
}
console.log(swop(2,3)) // [3,2]
设arr = [43,32,1,5,9,22];
const sort = arr => {
arr.forEach((v,i) => {
for(设j = I+1;j <数组长度;j++) {
if (arr[i] > arr[j]) {
[arr[i],arr[j]] = [arr[j],arr[i]]
}
}
})
返回arr
}
console.log(sort(arr)) // [1,5,9,22,32,43]
文章来自web前端学习圈。
推荐阅读:
前端开发的JS规范
面向前端开发的JS原型知识共享
前端开发的JS阵列去重方法返回搜狐查看更多。
负责编辑: