2018前端面试常见算法题

var obj={  0:'我',  1:'的',  2:'妈',  3:'呀',  length:4}//obj格式必须是类似数组的格式（键值是索引，具有length属性）var _slice=[].slice;var objArr=_slice.call(obj);

function countMost(str) {  const objCount = {};
  str = str.split('').sort().join('');  for(let i=0; i<str.length; i++) {    let lastIndex = str.lastIndexOf(str[i]);
    num = lastIndex - i + 1;
    objCount[str[i]] = num;
    i = lastIndex;
  }  let maxStr = [],
      maxValue = 1;  for(let p in objCount) {    if(objCount[p] > maxValue) {
      maxStr = [];
      maxStr.push(p);
      maxValue = objCount[p];
    }else if(objCount[p] == maxValue){
      maxStr.push(p);
    }
  }  return maxStr.length == 1? maxStr[0] : maxStr;
}console.log(countMost('afjghdfffffraaaasdddddenas'));

const arr = [10,5,11,7,8,9];function getMaxProfit(arr) {  let max = arr[0],
      min = arr[0];  for(let i=1; i<arr.length; i++) {
    max = Math.max(max,arr[i]);
    min = Math.min(min,arr[i]);
  }  return max - min;
}console.log(getMaxProfit(arr));

function maxAndMin(arr){  return {    max:Math.max.apply(null,arr.join(',').split(',')),    min:Math.min.apply(null,arr.join(',').split(','))
  }
}var arr = [22,0,[3,4,2,55]];
maxAndMin(arr).max;// 55maxAndMin(arr).min;// 0

function getRandomStr(len) {  var str = "";  for( ; str.length < len; str += Math.random().toString(36).substr(2));  return str.substr(0, len);
}