JS uses regular expression to find the longest continuous substring length

I won’t say much nonsense, I will just post the code to you. The specific code is as follows:

function maxLenStr(str){
  var len = 0, max_len = 0;
  var reg = new RegExp("(.)\\1{1,}","g");
  var res = (str);
  while(res != null){
    len = res[0].length;
    if(max_len < len){
      max_len = len;
    }
    res = (str)
  }
  return max_len;
}

js use regular search substrings

var str = '#param1#abcdef#param2#hjklllj#param3#7878'
var count = (/param\d*/g)
(count) ／／ ["param1", "param2", "param3"]

Summarize

The above is the js regularity that the editor introduced to you. I hope it will be helpful to you. If you have any questions, please leave me a message and the editor will reply to you in time. Thank you very much for your support for my website!