应用链表思想,以键值的形式,存进对象;
<!DOCTYPE html>
<html>
<head>
<meta charset="UTF-8">
<title>一个数组中,出现次数最多的字符,及其位置</title>
</head>
<body>
<script type="text/javascript">
var arr=["a","x","b","d","m","a","k","m","p","j","a","a"];
var str="what are you";
//找出出现次数最多的字符。及其次数
function unique(str){
var obj={}; //存储出现的次数
var objIndex=[];
for(var i=0;i<str.length;i++){
var key=str[i];
// console.log(key)
// console.log(obj[key])
if(obj[key]){ //判断这个键值对中有没有这个值
obj[key]++;
}else{
obj[key]=1;
}
}
//找出出现最多的次数的字符
var maxCount=0;
var maxString="";
for(var key in obj){
if(maxCount<obj[key]){
maxCount=obj[key];
maxString=key;
}
}
return "该字符"+maxString+"出现了"+maxCount+"次;";
}
console.log(unique(str));
console.log(unique(arr));
</script>
</body>
</html>