一、寻找最长
< script>
function count ( str ) {
let i = 0 ;
let j = 0 ;
let maxChar = '' ;
let maxCount = 0 ;
while ( i< str. length) {
if ( str[ i] != str[ j] ) {
let count = j- i
if ( count> maxCount) {
maxCount = count
maxChar = str[ i]
}
i= j;
}
j++ ;
}
console. log ( "连续出现次数最多的字符是::" + maxChar, "出现次数为::" + maxCount)
}
count ( 'aaabbbbbbcccccccccccdddddddfffffffff1112' )
< / script>
二、寻找最短
public class SuanFa {
public static void main ( String [ ] args) {
count ( "aaabbbbcccccccccccc" ) ;
}
public static void count ( String str) {
int i = 0 ;
int j = 0 ;
int maxCount = str. length ( ) ;
String maxChar = "" ;
while ( i < str. length ( ) ) {
if ( j == str. length ( ) || str. charAt ( i) != str. charAt ( j) ) {
int count = j - i;
if ( count <= maxCount) {
maxCount = count;
maxChar = str. charAt ( i) + "" ;
}
i = j;
}
j++ ;
}
System . out. println ( "连续出现次数最少的字符是::" + maxChar + ",出现次数为::" + maxCount) ;
}
}