fork(1) download
copy 
  1. #include <iostream>
  2.  
  3. std::pair<char, unsigned> longestSubstring(const std::string&);
  4.  
  5. int main() {
  6.     std::pair<char, unsigned> longest_substring = longestSubstring("aaaabbbbbbcccccccnee");
  7.     std::cout << "Longest reoccuring character is: '" << longest_substring.first
  8.               << "', at: " << longest_substring.second << " times." << std::endl;
  9.     return 0;
  10. }
  11.  
  12. std::pair<char, unsigned> longestSubstring(const std::string &s){
  13.     unsigned max_length = 0, curr_length = 0;
  14.     char last, max = 0;
  15.     for(char c: s) {
  16.         curr_length++;
  17.         if(c != last) {
  18.             if(curr_length > max_length) {
  19.                 max_length = curr_length;
  20.                 max = last;
  21.             }
  22.             curr_length = 0;
  23.         }
  24.         last = c;
  25.     }
  26.     return std::make_pair(max, max_length);
  27. }
Success #stdin #stdout 0s 3228KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Longest reoccuring character is: 'c', at: 7 times.
https://ideone.com/D6vSCT
language:
C++14 (gcc 8.3)
created:
9 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!