第11题(2019-08-05)： 编程题，找出字符串中连续出现最多的字符和个数 about interview

[qappleh]

const arr = str.match(/(\w)\1*/g);
const maxLen = Math.max(...arr.map(s => s.length));
const result = arr.reduce((pre, curr) => {
  if (curr.length === maxLen) {
    pre[curr[0]] = curr.length;
  }
  return pre;
}, {});
console.log(result);

[qiqingfu]

不考虑空间和时间复杂度，- .. -

function findMost(str) {
  const m = new Map();
  for (let s of str) {
    if (m.has(s)) {
      m.set(s, m.get(s) + 1);
    } else {
      m.set(s, 1);
    }
  }

  const maxValue = Math.max.apply(null, [...m.values()]);
  let res = {};
  for (let [k, v] of m.entries()) {
    if (maxValue === v) {
      res[k] = v;
    }
  }

  return res;
}