Given a string, find the first non-repeating character in it and return it’s index. If it doesn’t exist, return -1.<\/p>\n
Examples:<\/b><\/p>\n Note:<\/b>\u00a0You may assume the string contain only lowercase letters.<\/p>\n Python<\/strong><\/p>\ns = \"leetcode\"\r\nreturn 0.\r\n\r\ns = \"loveleetcode\",\r\nreturn 2.\r\n<\/pre>\n
\r\nclass Solution:\r\n def firstUniqChar(self, s):\r\n """\r\n :type s: str\r\n :rtype: int\r\n """\r\n a = dict()\r\n index = 0\r\n while index < len(s):\r\n if not isinstance(a.get(s[index], False), bool):\r\n a[s[index]] = -2\r\n else:\r\n a[s[index]] = index\r\n index += 1\r\n result = -1\r\n for key, value in a.items():\r\n if value != -2:\r\n if result != -1:\r\n result = min(result, value)\r\n else:\r\n result = value\r\n return result\r\n\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"