題目：在字符串中找出第一個(gè)只出現(xiàn)一次的字符拷获。
代碼如下：
package demo;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Set;
/**
* 第1個(gè)只出現(xiàn)1次的字符
*
* 記錄法
*
* @author xiangdonglee
*
*/
public class Test35 {
public static char firstNotRepeatingChar(String s) {
if (s == null || s.length() < 1) {
throw new IllegalArgumentException("Arg should not be null or empty!");
}
Map<Character, Integer> map = new LinkedHashMap<>();
for (int i = 0; i < s.length(); i++) {
char c = s.charAt(i);
if (map.containsKey(c)) {
map.put(c, -2);
} else {
map.put(c, i);
}
}
Set<Map.Entry<Character, Integer>> entrySet = map.entrySet();
// 記錄只出現(xiàn)一次的字符的索引
int index = Integer.MAX_VALUE;
// 記錄只出現(xiàn)一次的字符
char result = '\0';
for (Map.Entry<Character, Integer> entry : entrySet) {
if (entry.getValue() >= 0 && entry.getValue() < index) {
index = entry.getValue();
result = entry.getKey();
}
}
return result;
}
public static void main(String[] args) {
System.out.println("google:" + firstNotRepeatingChar("google"));
System.out.println("aabccdbd:" + firstNotRepeatingChar("aabccdbd:"));
System.out.println("abcdefg:" + firstNotRepeatingChar("abcdefg"));
System.out.println("gfedcba:" + firstNotRepeatingChar("gfedcba"));
System.out.println("zgfedcba:" + firstNotRepeatingChar("zgfedcba"));
}
}
運(yùn)行結(jié)果
來(lái)源：http://blog.csdn.net/derrantcm/article/details/46761041
