comefrom: <qiyuangong>003_Longest_Substring_Without_Repeating_Characters_2.py
code: def lengthOfLongestSubstring( s):
      sls = len(set(s))
      ls = len(s)
      if ls >= 1:
          max_l = 1
      else:
          return 0
      for i in range(ls):
          for j in reversed(range(i + max_l + 1, i + sls + 1)):
              curr = s[i:j]
              c_ls = len(curr)
              if len(set(curr)) == c_ls:
                  if c_ls > max_l:
                      max_l = c_ls
                      if max_l == sls:
                          return sls
                  break
      return max_l
masked: def sample_funcname ( var_0 ) :
      var_1 = len ( set ( var_0 ) )
      var_2 = len ( var_0 )
      if var_2 >= 1 :
          var_3 = 1
      else :
          return 0
      for var_4 in range ( var_2 ) :
          for var_5 in reversed ( range ( var_4 + var_3 + 1 , var_4 + var_1 + 1 ) ) :
              var_6 = var_0 [ var_4 : var_5 ]
              var_7 = len ( var_6 )
              if len ( set ( var_6 ) ) == var_7 :
                  if var_7 > var_3 :
                      var_3 = var_7
                      if var_3 == var_1 :
                          return var_1
                  break
      return var_3
  