1、js 統計一個字串出現頻率最高的字母/數字
let str = 'asdfghjklaqwertyuiopiaia';
const strChar = str => {
let string = [...str],
maxValue = '',
obj = {},
max = 0;
string.forEach(value => {
obj[value] = obj[value] == undefined ? 1 : obj[value] + 1
if (obj[value] > max) {
max = obj[value]
maxValue = value
}
})
return maxValue;
}
console.log(strChar(str)) // a
複製程式碼2、陣列去重
2.1、forEach
let arr = ['1', '2', '3', '1', 'a', 'b', 'b']
const unique = arr => {
let obj = {}
arr.forEach(value => {
obj[value] = 0
})
return Object.keys(obj)
}
console.log(unique(arr)) // ['1','2','3','a','b']
複製程式碼2.2、filter
let arr = ['1', '2', '3', '1', 'a', 'b', 'b']
const unique = arr => {
return arr.filter((ele, index, array) => {
return index === array.indexOf(ele)
})
}
console.log(unique(arr)) // ['1','2','3','a','b']
複製程式碼2.3、set
let arr = ['1', '2', '3', '1', 'a', 'b', 'b']
const unique = arr => {
return [...new Set(arr)]
}
console.log(unique(arr)) // ['1','2','3','a','b']
複製程式碼2.4、reduce
let arr = ['1', '2', '3', '1', 'a', 'b', 'b']
const unique = arr.reduce((map, item) => {
map[item] = 0
return map
}, {})
console.log(Object.keys(unique)) // ['1','2','3','a','b']
複製程式碼3、翻轉字串
let str ="Hello Dog";
const reverseString = str =>{
return [...str].reverse().join("");
}
console.log(reverseString(str)) // goD olleH
複製程式碼4、陣列中最大差值
4.1、forEach
let arr = [23, 4, 5, 2, 4, 5, 6, 6, 71, -3];
const difference = arr => {
let min = arr[0],
max = 0;
arr.forEach(value => {
if (value < min) min = value
if (value > max) max = value
})
return max - min ;
}
console.log(difference(arr)) // 74
複製程式碼4.2、max、min
let arr = [23, 4, 5, 2, 4, 5, 6, 6, 71, -3];
const difference = arr => {
let max = Math.max(...arr),
min = Math.min(...arr);
return max - min ;
}
console.log(difference(arr)) // 74
複製程式碼5、不借助臨時變數，進行兩個整數的交換
5.1、陣列解構
let a = 2,
b = 3;
[b,a] = [a,b]
console.log(a,b) // 3 2
複製程式碼5.2、算術運算（加減）
輸入a = 2,b = 3,輸出 a = 3,b = 2
let 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]
複製程式碼5.3、邏輯運算（異或）
let a = 2,
b = 3;
const swop = (a, b) => {
a ^= b; //x先存x和y兩者的資訊
b ^= a; //保持x不變，利用x異或反轉y的原始值使其等於x的原始值
a ^= b; //保持y不變，利用x異或反轉y的原始值使其等於y的原始值
return [a,b];
}
console.log(swop(2,3)) // [3,2]
複製程式碼6、排序 (從小到大)
6.1、氣泡排序
let arr = [43, 32, 1, 5, 9, 22];
const sort = arr => {
let res = []
arr.forEach((v, i) => {
for (let j = i + 1; j < arr.length; j++) {
if (arr[i] > arr[j]) {
[arr[i],arr[j]] = [arr[j],arr[i]]
}
}
})
return arr
}
console.log(sort(arr)) // [1, 5, 9, 22, 32, 43]
複製程式碼