WebMay 19, 2024 · function firstNonRepeatedCharacterPosition (string) { for (let char, pos, i = 0; i < string.length; ++i) { char = string.charAt (i); pos = string.indexOf (char); if (pos == i && string.indexOf (char, i + 1) == -1) { return pos; } } return -1; } console.log (firstNonRepeatedCharacterPosition ('abcbebc')); WebFirst Unique Character in a String – Solution in Python class Solution(object): def firstUniqChar(self, s): freq = Counter(s) for e in s : if freq[e] == 1 : return s.index(e) return …

First Unique Character in a String LeetCode Solution - TutorialCup

WebNote: You may assume the string contain only lowercase letters. **/ //Runtime: 40 ms, faster than 86.06% of C++ online submissions for First Unique Character in a String. //Memory Usage: 12.8 MB, less than 99.44% of C++ online submissions for First Unique Character in a String. class Solution {public: int firstUniqChar(string s) WebNov 29, 2015 · Find the first unique character in a string So evaluating the string ABCA would return B. My implementation does the following: Initialize a boolean array that is … crypto free claim

First Unique Character in a String - LeetCode

Webpublic int firstUniqChar (String s) { int [] charCount = new int [26]; for(int i=0; i < s.length(); i++){ char c = s.charAt(i); charCount[c - 'a'] = charCount[c - 'a'] + 1; } for(int i=0; i< … WebSep 8, 2024 · Lets take a look at the simple solution. Have two loops. first will iterate till length of string. in second loop, iterate from beginning to end. And check if the character is found anywhere. We can keep track of duplicate found by a boolean flag. And if during our inner loop, if we found that character is not found. This is our answer. Web387. 字符串中的第一个唯一字符 - 给定一个字符串 s ，找到 它的第一个不重复的字符，并返回它的索引 。如果不存在，则返回 -1 。 示例 1： 输入: s = "leetcode" 输出: 0 示例 2: 输入: s = "loveleetcode" 输出: 2 示例 3: 输入: s = "aabb" 输出: -1 提示: * 1 <= s.length <= 105 * s 只 … crypto free hub