387. First Unique Character in a String [LeetCode]
来源：互联网 发布：ubuntu怎么看软件位置 编辑：程序博客网 时间：2024/06/04 22:46
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.
由题意，要求给定的字符串中第一个无重复的字符的下标。
思路简析：由于题目中给了个note：所给字符串中只有小写字母。可以考虑，先用一个有26个元素整型数组存储每个字母在串中的出现次数；再从左到右遍历串，如果读到的字符在数组中值为1，即只出现了这一次，无重复，返回此时字符的下标。如果读到结束还没有返回，则会返回代表没有找到的-1。
具体的java代码如下：
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 解题报告
- 平凡的幸福(深度好文)
- 代码编辑器CodeMirror
- javascript基础：window对象的screen属性、移动窗口、缩放窗口
- 寒假篇13-台阶问题
- Android系统分析之JobScheduler源码分析
- 387. First Unique Character in a String [LeetCode]
- SharePreference保存list
- 贝塞尔曲线扫盲
- Ubuntu14.04上轻松安装与优化轻量级深度学习框架Theano[转]
- android 添加商品到购物车简单动画工具类
- 压力测试工具
- google c++ style 阅读笔记
- Eclipse编辑保存时自动格式化配置
- 异步 FIFO 控制器 (Asynchronous FIFO Controller)
