title: Python: Find longest binary gap in binary representation of an integer number
body: <p>I would like to know if my implementation is efficient.
  I have tried to find the simplest and low complex solution to that problem using python.</p>
  
  <pre><code>def count_gap(x):
      """
          Perform Find the longest sequence of zeros between ones "gap" in binary representation of an integer
  
          Parameters
          ----------
          x : int
              input integer value
  
          Returns
          ----------
          max_gap : int
              the maximum gap length
  
      """
      try:
          # Convert int to binary
          b = "{0:b}".format(x)
          # Iterate from right to lift 
          # Start detecting gaps after fist "one"
          for i,j in enumerate(b[::-1]):
              if int(j) == 1:
                  max_gap = max([len(i) for i in b[::-1][i:].split('1') if i])
                  break
      except ValueError:
          print("Oops! no gap found")
          max_gap = 0
      return max_gap
  </code></pre>
  
  <p>let me know your opinion.</p>