title: RegEx: Matching n-char long sequence of repeating character
body: <p>I want to split of a text string that might look like this:</p>
  
  <p><code>(((Hello!</code> --> <code>(((</code> and <code>Hello!</code></p>
  
  <p>or
  <code>########No?</code> --> <code>########</code> and <code>No?</code></p>
  
  <p>At the beginning I have n-times the same special character, but I want to match the longest possible sequence.</p>
  
  <p>What I have at the moment is this regex:
  <code>([^a-zA-Z0-9])\\1+([a-zA-Z].*)</code></p>
  
  <p>This one would return for the first example 
  <code>(</code> (only 1 time) and <code>Hello!</code></p>
  
  <p>and for the second
  <code>#</code> and <code>No!</code></p>
  
  <p>How do I tell regEx I want the maximal long repetition of the matching character? </p>
  
  <p>I am using RegEx as part of a Java program in case this matters.</p>