leetcode 387. First Unique Character in a String
来源：互联网 发布：seo的营销方法 编辑：程序博客网 时间：2024/06/09 14:01
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.
方法：扫描两次，第一次记录次数，第二次给出位置、 我自己用的map，但是用数组感觉更合适。
public class Solution { public int firstUniqChar(String s) { char[] ch = s.toCharArray(); int count[] = new int[26]; for(char c : ch){ count[c-'a']++; } for(int i=0;i<ch.length;i++){ if(count[ch[i]-'a']==1){ return i; } } return -1; }} 0 0
- [Leetcode]First Unique Character in a String
- LeetCode: First Unique Character in a String
- LeetCode-First Unique Character in a String
- leetcode---First Unique Character in a String
- leetcode:First Unique Character in a String
- LeetCode-First Unique Character in a String
- [Leetcode] First Unique Character in a String
- leetcode First Unique Character in a String
- Leetcode First Unique Character in a String
- LEETCODE--First Unique Character in a String
- LeetCode -- First Unique Character in a String
- LeetCode : First Unique Character in a String
- LeetCode First Unique Character in a String
- LeetCode-----First Unique Character in a String
- LeetCode—387. First Unique Character in a String
- 【leetcode】387. First Unique Character in a String【E】
- <LeetCode OJ> 387. First Unique Character in a String
- [leetcode] 387. First Unique Character in a String 解题报告
- android——串口通信
- mybatis中orderBy排序
- ISE调用ue
- slab分配器
- 字符串压缩程序，即整型数存入字符数组
- leetcode 387. First Unique Character in a String
- C - Fire Net
- java中数组的应用
- Linux内核移植 part3：Exynos4412 Linux Kernel移植
- struts综合案例
- C++报错及解决问题（持续跟新）
- 面向对象-类和对象
- 前端技术学习之选择器（一）
- 快捷判断无损连接
