- 算法构成
- 控制结构(顺序、分支、循环)
- 原操作(固有数据类型的操作)
- 常见js算法
var str = 'ddcflldkd';
function showMax(str) {
var array = str.split('');
var maxnum = 0, maxValue = '';
for (var i=0; i<array.length; i++) {
var count = 0;
for (var j=i+1; j<array.length-i; j++) {
if (array[i] == array[j]) {
count ++;
}
}
if (count > maxnum) {
maxnum = count;
maxValue = array[i];
}
}
return maxValue;
}
var value = showMax(str);
console.log('value', value);
const strChar = str => {
let array = [...str],
maxValue = '',
obj = {
},
max = 0;
console.log('array', array);
array.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));
var arr = ['1', '2', '3', '1', 'a', 'b', 'b'];
var i,j,len = arr.length;
for ( i = 0 ; i < len; i++) {
for ( j = i + 1; j < len; j++) {
if (arr[i] == arr[j]) {
arr.splice(j, 1);
len--;
j--;
}
}
}
console.log('array', arr);
const unique = arr =>{
let obj = {
};
arr.forEach(item => {
obj[item] = 1;
});
return Object.keys(obj);
}
console.log(unique(arr));
const unqiue = arr => {
return [...new Set(arr)];
}
const