leetcode:https://leetcode-cn.com/problems/first-unique-character-in-a-string/
387. 字符串中的第一个唯一字符
给定一个字符串 s ,找到 它的第一个不重复的字符,并返回它的索引 。如果不存在,则返回 -1 。
Given a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1.
示例 1:
输入: s = “leetcode”
输出: 0
示例 2:
输入: s = “loveleetcode”
输出: 2
示例 3:
输入: s = “aabb”
输出: -1
Example 1:
Input: s = “leetcode”
Output: 0
Example 2:
Input: s = “loveleetcode”
Output: 2
Example 3:
Input: s = “aabb”
Output: -1
对题目进行解析
将s中的每项和出现的次数储存起来
在通过对s字符串进行遍历,直到找到相应值对应的数为1,返回索引值
不符合返回-1
var firstUniqChar = function (s) {
let object = Object.create(null)
let len = s.length
for (const i of s) {
if (object[i] == void 0) {
object[i] = 1
} else {
object[i]++
}
}
let i = -1
while (i++ < len) {
if (object[s[i]] == 1) return i
}
return -1
};