思路:利用ASCII 的編碼,
1,一次遍歷得到所有字符的下標對應出現的次數
2,遍歷結果,找出第一次只出現一次的字符
3,此算法的時間復雜度為O(n)
package com.jpush.excel; import java.util.Scanner; public class Client { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); while (scanner.hasNext()){ char firstChar = firstChar(scanner.next()); char c = (char) -1; if (firstChar == c) { System.out.println("-1"); } else { System.out.println(firstChar); } } } private static char firstChar(String str) { int[] chars = new int[58]; char[] charArray = str.toCharArray(); for (char c : charArray) { chars[c - 65] += 1; } for (int i = 0; i < charArray.length; i++) { if (chars[charArray[i] - 65] == 1) { return charArray[i]; } } return (char) -1; } }