C++ 字符串中最长的连续出现的字符

采用双指针思想：

#include <iostream>
#include <string>

using namespace std;

int main () 
{
    int N;
    cin>>N;
    while(N > 0)
    {
        string s, maxs;
        int maxn = -1;
        cin>>s;
        for(int i = 0; i < s.size(); i ++) {
            int j = i;
            int n = 0;
            while(s[i] == s[j] && j < s.size()) {
                n ++;
                j ++;
            }
            if(n > maxn) {
                maxn = n;
                maxs = s[i];
            }
        }
        cout<<maxs<<" "<<maxn<<endl;
        N --;
    }
    return 0;
}