-
- #Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.
- #xamples:
- #s = "leetcode"
- #return 0.
-
- #s = "loveleetcode",
- #return 2.
- #Note: You may assume the string contain only lowercase letters.
-
- class Solution(object):
- def firstUniqChar(self, s):
- """
- :type s: str
- :rtype: int
- """
- for i in range(len(s)):
- for j in range(i+1,len(s)):
- if s[i] == s[j]:
- break
- #But now what. let's say i have complete loop of j where there's no match with i, how do I return i?
-