Get String Unique longest substring

Coding #:. 8 UTF- 
DEF find_longest_no_repeat_substr (one_str): 
    '' '' ' 
    to find out a string of the longest substring will not be repeated 
    ' '' 
    res_list = [] 
    length = len (one_str) 
    for I in Range (length): # respectively each character string as a character from the first string 
        tmp = one_str [i] # is not recorded sequence repeats intermediate variables 
        for J in Range (I +. 1, length): 
            IF one_str [J] not tmp in: 
                tmp + = one_str [J] 
            the else: 
                BREAK 
        res_list.append (tmp) # Unique save all substrings 
    res_list.sort (lambda x, y: cmp (len (x), len (y)), reverse = True) # Unique descending order according to the length of the substring in each 
    return res_list [0] 


IF the __name__ == '__main__':
    = one_str_list [ '120 135 435', 'abdfkjkgdok', '123,456,780,423,349']
    one_str in one_str_list for: 
        RES = find_longest_no_repeat_substr (one_str) 
        Print '{0} is the longest non-repeating sub-string: {1}' format (one_str , res).