首页 > 代码库 > LeetCode - 387. First Unique Character in a String
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.
Note: You may assume the string contain only lowercase letters.
public class Solution { public int firstUniqChar(String s) { if (s == null || s.length() <= 0) return -1; int[] latter = new int[26]; for (int i=0; i<s.length(); i++) { latter[s.charAt(i)-‘a‘] ++; } for (int i=0; i<s.length(); i++) { if (latter[s.charAt(i)-‘a‘] == 1) { return i; } } return -1; } }
LeetCode - 387. First Unique Character in a String
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。