算法系列（16）Leetcode 387 First Unique Character in a String

Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.

Examples:

s = "leetcode"
return 0.

s = "loveleetcode",
return 2.

思路：若要查找整个字符串是否有重复字符，则一定会用到遍历，如果字符为字符串中唯一出现的，则第一次出现位置与最后出现位置一定相同。

/**
 * @param {string} s
 * @return {number}
 */
var firstUniqChar = function(s) {
    for(var i=0; i<s.length; i++){
        if(s.indexOf(s[i])===s.lastIndexOf(s[i])){
            return i;
        }
    }
    return -1;
};