哈希表 - 字符串中的第一个唯一字符

思路：先把唯一的数都放在字典里，然后根据字典的键值对，也就是索引的值来判断一对一的比长度大小

s = "leetcode"
返回 0

s = "loveleetcode"
返回 2

hash = dict()
n = len(nums)
for i,ch in enumates(nums):
    if ch in hash:
    hash[ch] = -1
   else:
      hash[ch] = i 
 first  = n 
 for k in hash.vlaues():
    if k !=-1 and k < first:
    first  = k
if first ==n:
return -1
return first