Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. 给一个字符串,返回第一个不重复的字符的index,要是没有的话就返回-1 //第一次做,感觉巨简单,设一个set,一旦contains,就用striing
publicclassSolution { publicintfirstUniqChar(String s) { int[] a =newint[26]; for(inti =0; i < s.length(); i++) a[s.charAt(i) -'a']++; for(inti =0; i < s.length(); i++){ if(a[s.charAt(i) -'a'] ==1) returni; } return-1; } }...
Given a string s, return the first non-repeating character in it and return its index. If it does not exist, return -1. 中文 针对给定的一个字符串 s,你需要写一个算法,返回给定字符串中不重复字符的位置(index),如果所有的字符在给定的字符串中都有重复的话,那么你应该返回 -1。 样例 下面给出...
Given a string s, return the first non-repeating character in it and return its index. If it does not exist, return -1. 中文 针对给定的一个字符串 s,你需要写一个算法,返回给定字符串中不重复字符。 这个题目在随后的面试中又出来变种。 这次需要函数返回的找到的字符串,同时输入的字符串中还有大...
Write a Java program to find the index of the first unique character in a given string. Assume that there is at least one unique character in the string. Pictorial Presentation: Sample Solution: Java Code: importjava.util.*;publicclassSolution{publicstaticvoidmain(String[]args){// Test the ...
标签: Java Python 算法 收藏 LeetCode 387: 字符串中的第一个唯一字符 First Unique Character in a String 题目: 给定一个字符串,找到它的第一个不重复的字符,并返回它的索引。如果不存在,则返回 -1。 Given a string, find the first non-repeating character in it and return it’s index. If it...
for i,c in enumerate(s): if cnt[c] == 1: return i return -1 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. java 里还可以,直接一次扫描s搞定: class Solution { public int firstUniqChar(String s) { Map<Character, Integer> map = new LinkedHashMap<>(); ...
Given a string s, return the first non-repeating character in it and return its index. If it does not exist, return -1. 中文 针对给定的一个字符串 s,你需要写一个算法,返回给定字符串中不重复字符。 这个题目在随后的面试中又出来变种。
Given a string s, return the first non-repeating character in it and return its index. If it does not exist, return -1. 中文 针对给定的一个字符串 s,你需要写一个算法,返回给定字符串中不重复字符。 这个题目在随后的面试中又出来变种。 这次需要函数返回的找到的字符串,同时输入的字符串中还有大...
Can you solve this real interview question? First Unique Character in a String - Given a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1. Example 1: Input: s = "leetcode" Output: 0 Expla