附上一张思维导图:
//检测是否为数组
var arr = [1,2,4];
var text = 2;
console.log(arr instanceof Array);
console.log(text instanceof Array);
var length = arr.push('red','purple');
console.log(arr+'数组长度'+length);
var len = arr.unshift('green','blue');
console.log(arr+'数组长度为'+len);
console.log(arr.pop()); //返回的参数是删除的元素(即最后一个元素)
console.log(arr.shift());
//数组翻转
console.log(arr.reverse());
var arr1 = [1,89,20,38,19,26];
//冒泡排序
console.log(arr1.sort(function(a,b){
return a - b;//升序排列
}));
//数组索引
var arr2 = ['blue','red','blue','green','blue'];
//console.log(arr2.indexOf('blue'));
console.log(arr2.indexOf('blue'));
数组去重:
function unique(arr){
var newArr = [];
for(var i = 0; i<arr.length;i++){
if(newArr.indexOf(arr[i]) === -1){
newArr.push(arr[i]);
}
}
return newArr;
}
var arr1 ='ocbochscollavb';
console.log(unique(arr1));
统计出现最多的字符和次数:
function findMaxTime(str){
var o = {};
for(var i = 0;i<str.length;i++){
var chars = str[i];
if (o[chars]) {
o[chars]++;
}else{
o[chars] = 1;
}
//遍历对象
var max = 0;
var ch ='';
for (var k in o) {
if(o[k]>max){
max = o[k];
ch = k;
}
}
}
console.log('出现最多的字符为'+ch+'\n'+'出现的次数为'+max);
}
var str2 = 'oxccoqoeocoaodo';
console.log(findMaxTime(str2));
替换字符,将字符o替换为*
//全部替换出现的字符
function replaceLetter (str) {
while (str.indexOf('o') !==-1){
str = str.replace('o','*'); //只替换第一个出现的字符
}
console.log(str);
}
var str2 = 'oxccoqoeocoaodo';
replaceLetter(str2);
查找字符出现的位置:
//查找字符o出现的位置
function findLetter(str){
var indexs = str.indexOf('o');
while (indexs !== -1){
console.log(indexs);
indexs = str.indexOf('o',indexs+1);
}
}
var str2 = 'oxccoqoeocoaodo';
findLetter(str2);